text:
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS. VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 1231 Regular Correspondence A Self- organizing Binary Decision Tree for Incrementally Defined Rule- Based Systems Tony R. Martinez and Douglas M. Campbell Abstract- This paper presents an adaptive self- organizing concurrent system ( ASOCS) model for massively parallel processing of incrementally defined rule systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. This paper focuses on adaptive algorithm 3 ( AA3) and details its architecture and learning algorithm. It has advantages over previous ASOCS models in simplicity, implementability, and cost. An ASOCS can operate in either a data processing mode or a learning mode. During the data processing mode, an ASOCS acts as a parallel hardware circuit. In learning mode, rules expressed as Boolean conjunctions are incrementally presented to the ASOCS. All ASOCS learning algorithms incorporate a new rule in a distributed fashion in a short, bounded time. I. INTRODUCTION This paper presents an adaptive self- organizing concurrent sys-tem ( ASOCS) architecture [ 6], [ 7], [ 101 that guarantees learning for Boolean rule- based systems in bounded time. This particular ASOCS uses adaptive algorithm 3 and has significant simplicity, implementability, and cost advantages over previous ASOCS models [ SI, [ 9]. Target applications include rule and example based systems for logical inference, robotics, adaptive logic, fault- recovery, and real- time dynamic control. The search for fast and robust computation has increased research in highly parallel systems with both traditional 121, [ 4] and connec-tionist [ 5], [ 14] views. Researchers of massively parallel systems seek speed both during processing and learning. However, programming and updating massively parallel systems incur tremendous overhead and complexity. The goal of ASOCS is to train ( program) a parallel digital network to solve problems defined by rule- based propositional logic. A system is trained ( programmed) through the incremental input of rules expressed as conjunctions of Boolean variables. Real world applications using rule- based propositional logic are forthcoming [ 3]. An ASOCS is an adaptive network of many simple computing elements operating in a parallel, asynchronous fashion. ASOCS can operate in both data processing and data learning modes. During data processing the system acts as a parallel hardware circuit; it asynchronously maps input data to output data in O( max( d, log r t ) ) time, where ( 1 is the maximum depth ( longest path) of the network, and r1 is the number of network nodes, as is typical for hardware circuits. During learning the system reconfigures itself in a distributed manner to accommodate new ( and perhaps conflicting) rules. ASOCS potential comes from its ability to guarantee adaptation in (>( log ( n ) ) time for any new rule. Through its learning process the system discovers the critical variables; it uses these to generalize and classify large input spaces. Manuscript received October 12, 1989; revised April 12, 1991.2 The authors are with the Computer Science Department, Brigharn Young IEEE Log Number 9101213. University, Provo, UT 84602. The majority of ASOCS research on adaptive algorithms has focused on adaptive algorithm 1, adaptive algorithm 2, and adaptive algorithm 3. Details for AA1 can be found in [ 8]; details for AA2 can be found in [ 9]. These three algorithms vary dramatically, although AA3 shares some similarity to AA2. ASOCS arose from reexamining perceptron [ 121 related ideas. The basic building block, however, is that of digital programmable nodes, an idea spawned by the notion of a universal logic module ( ULM) [ 161. Verstraete [ 151 sought methods of programming fixed ULM structures to solve arbitrary Boolean mappings. ASOCS departs from these efforts by using a nonpassive network that adapts in a self- organizing fashion [ 6], [ lo]. This technique has led to models promising parallel inference, high- speed adaptation, and internal consistency control. Proof of concept VLSI fabrication of ASOCS devices has been completed [ l] and other implementations are currently underway. Formal proof of AA3 is found in [ 17]. Although ASOCS research was initiated with a neural network emphasis, the proposed mechanisms differ extensively from standard neural network paradigms. The authors make no claim to be modeling neural functionality with this model. Rather, distributed, parallel, and self- organizing paradigms are used in order to attain an improved computational mechanism, offering speed, fault tolerance, anci ease of use. The outline of the paper follows. Section I1 defines the mechanism of knowledge input. Section I11 described AA3 during processing mode. Section IV describes AA3 during learning mode. Section V works in detail a concrete example of AA3 learning. Section VI extends the model to multiple outputs. Section VI1 discusses the advantages of ASOCS. Sections VI11 and IX overview simulation results, comparisons with AA1 and AA2, and current research efforts. 11. KNOWLEDGE INPUT The atomic knowledge element 1' the instance. Each instance is a ( partial) function from a set of Boolean variables to a Boolean variable. Thus each instance is a propositional production rule. Following are examples of instances: I) m. 4- B * c 11) .4- BC * 4 111) w. 4- B * - C, Instance I forces C to become true whenever A and B are false. Instance I1 forces .- I to become false whenever A and C are true and B is false. Instance 111 forces C to become false whenever A and B are false. Instances I and 111 are inconsistent with each other; when - 4 and B are false, instance I tries to set C to true while instance Ill tries to set C to false. When the variables of an instance are not matched, the instance says nothing about the output of the function. ( An implementation may set the output variable to true, to false, or even to don't know.) Instances are incomplete and partial functions by definition. The union of a set of instances defines another partial function. It is a ( partial) function defined by a set of rules, a functional rule base. A set of instances is called an instance set. An instance with a nonnegated variable on its right- hand side is called apositive instance; an instance with a negated variable on its right- hand side is called a negative instance. Thus each instance has either negative or positive polarity. 0018- 9472/ 91$ 01.00 0 1991 IEEE 1232 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 A Boolean variable occurring in one instance and occurring in its complemented form in another instance is said to be a discriminant variable for the two instances. An instance set S is consistent if S does not contain any two instances S and I' where S is a positive instance, I- is a negative instance and 1) they have the same right- hand variable and 2) there is a set of Boolean values which can simultaneously match the left-hand sides of X and I-. We require an instance set to be well defined ( consistent). Thus, no two instances have a common set of Boolean values for which the function produces inconsistent values. Two fundamental types of inconsistencies exist. The first type is ob-vious; the same variables define the output inconsistently as in - 4C + B and *- IC - B. The second type is more subtle. Although the rules AD + B and C + - B do not have identical left- hand vari-ables, when A. D. and C are all true, B becomes both true and false. Fortunately, there is a basic computational tool for inconsistency. Its proof is omitted. Lemma: Two instances are inconsistent if and only if they are of opposite polarities and have no discriminant variable. I) AB + C 11) BC + - C 111) - BC 3 - C. For example, Instance I above is inconsistent with I1 because there is no discriminant variable. Instance I is consistent with 111 because of the discriminant variable B. Instances I1 and 111 cannot be inconsistent because they are of the same polarity. In the ASOCS model, instances are input incrementally. Let - TI be a new instance and S be an instance set. Either - 1- 1is consistent with S or else there is at least one instance of S with which - 1- 1 is inconsistent. An - TI may contain new information or be redundant to informa-tion already contained in the instance set. By definition, a - TI is redundant with respect to an instance set S, if the partial function defined by the S I is already contained in the partial function defined by S. For example, let the instance set be D* C B - C and let the new instance be AB 3 C. Clearly, the fact that AB forces C is already contained by the second instance of the original system. Since the new instance adds no information, parsimony suggests that we delete it. By definition, an - VI contains new information with respect to an instance set S if the partial function defined by the 1- 1 extends the partial function defined by S. For example, let the instance set S be - 4 * c B* C and let the new instance be --- I - B + C. In this case, the new instance tells us to set C' to true when A and B are false, an extension of the partial function defined by S. The principle of parsimony may also apply to new information. For example, let the instance set be . AB + C ' 4- c + c B* C and let the S I be A + C. The new instance contains new in-formation; it tells us what to do when - 4 is true and B is false, as well as what to do when - 4 is true and C is false. But more than that, the original instances AB =+ C and - 4 - C + C are now redundant as they are but special cases of A + C. If we can detect such redundancies quickly, then parsimony suggests they be deleted. However, perhaps more important than parsimony, is that by removing " don't care" information, the system can find critical features that can aid in generalizing to a good output when the system receives input for which no training has taken place. If a new instance is inconsistent with an instance set, then we give precedence to the newer instance and remove the contradicted portion of the old instance. Theorem: Let S1 + Z be a new instance and S2 + - Z be an old instance. Suppose there is no discriminant variable for the new and old instance. If S1 is a subset of S2, then every part of the old instance contradicts the new instance. Proof: Since S2 is a subset of S1, every set of variables that realizes S2 ( and forces Z to be false by the old instance) extends to variables that realize S1 ( which forces Z to be true by the new instance). Therefore, every part of the partial function defined by S1 + Z is a rewrite of S2 - 2, that is, the new instance con-tradicts everything for which the old rule stood. Q. E. D. Theorem: Let S1 + 2 be a new instance and S2 + - Z be an old instance. Suppose there is no discriminant variable for the new and old instance. Suppose S1 is not a subset of S2. Let S3 be those variables in S1 that are not in S2. Then the part of the old instance that is not contradicted by the new instance is given by the following set of instances (- 152 + - Z: I is in S3). Proof: Since S1 is not a subset of S2, there is a variable in S1 that is not in S2. Thus, the set S3 is not empty. Let I belong to S3. The instance 5 2 3 - Z is the union of the two rules: IS2 + - Z and - 1.52 + - Z. Since I belongs to S1 and since there is no discriminant variable for S1 and S2, we can find Boolean values for S1, I , and S2 so that all hold, forcing Z to be set inconsistently. On the other hand, S1 + Z and - IS2 * - Z now share the discriminant variable I and are therefore not inconsistent. That is, we may save the - IS2 + - 2 part of the old instance for each variable in S3. This concludes the proof of the theorem. Q. E. D. For example, consider the new instance .- ICD + - Z confront-ing the old instance - 4Ll + Z. Since - 4CD is not a subset of AB we form the variables in the new instance that are not in the old instance, namely C and D. The theorem says to replace AB + Z by the pair of instances - CAB + Z and - D.- IB + Z. We may therefore take any consistent instance set and any new instance and produce a new instance set that contains as much of the old instance set as can be saved with the new instance being given precedence. The number of instances in the new instance set may be greater than, less than, or equal to the number of instances in the original instance set ( depending on the amount of redundancy or contradiction). In the new instance set, all instances have equal priority and order is again inconsequential. Instances may come from human intervention or automated mech-anisms. Typical learning has more general instances ( those with fewer antecedent variables) entered first with refinement through more specific instances ( those with more antecedent variables). In the AA3 ASOCS implementation of the next section, the system maintains consistency in a manner invisible to the user. By dynamically modifying the instance set, the system discovers which variables are critical in making decisions. This leads to natural algorithmic generalization through critical variables when the system receives novel inputs. In the AA3 ASOCS model, the system does not explicitly store the instance set; instead, the system stores the information implicitly in a distributed fashion. 111. THE ASOCS AA3 MODEL In this section we show how the AA3 ASOCS dynamic parallel IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 1233 Binder Fig. 1 Binder 4A3 architecture. Error ( inconsistent) Output Error ( no match) Fig. 3. Collector structure. Left Parent Right Parent Fig. 4. Example network configuration Vanable Node Child Child Fig. 2. AA3 network node network models a consistent instance set. We say that an AA3 ASOCS model fulfills a consistent instance set if whenever an input forces the instance set to logically output Z ( or - Z), then the AA3 dynamic parallel network physically outputs the corresponding Z ( or - Z). Fig. 1 gives the architecture of the AA3 ASOCS model. This section only discusses those parts of the architecture needed for execution. In Section IV we discuss how the model knows how to represent itself ( how it learns). During execution mode, only the logic network is active. The input data flows asynchronously through the network with only propagation delays. The feedback path allows the system to use an output variable as an input variable. ( If a clocked register is added at the output binder, then the system is similar to a dynamically adaptable finite state machine.) Each node within the logic network has the structure of Fig. 2. During execution mode, only the dyadic AND gate is active. Each node has two inputs called children: the node child and the variable child. The node child receives its input from a node; the node child's value represents a conjunction of other variables. The variable child is connected directly to an input variable. The conjunction of the node child and variable child is available for direct output as well as for further processing by another node. If a node outputs to another node, then it must output to exactly two nodes: its leftparent, and its right parent. Such parent nodes are said to be siblings with respect to each other. Each node control unit has memory for a 3- state polarity flag with value: P. D+. or D-. The symbol P signifies the node is a Primitive node ( Pnode for short). D+ signifies the node is a positive Discriminant node ( positive Dnode); D- signifies the node is a negative Discriminant node ( negative Dnode). Each node also contains a variable list, which is the total set of variables over which the node does a logical conjunction. The overall structure of the AA3 network is that of a binary decision tree as in Fig. 4. A node is a Dnode if and only if it is a ( top) leaf in this structure ( has no parents). A node is a Pnode if and only if it is an internal node in the tree ( has parents). The output of all positive Dnodes is sent to the positive collector; the output of all negative Dnodes is sent to the negative collector. Each collector performs a logical OR of its received values. Since the overall network is a binary decision tree, exactly one Dnode will be active for any input. A three node structure handles the collector outputs in Fig. 3. The middle node is the output node; it outputs Z if the positive collector is active ( a positive Dnode is active); it outputs - 2 if the negative collector is active ( a negative Dnode is active). If both positive and negative collector are inactive, or both collectors are active, then the network has an error. An error will not happen in the model as described, but could occur if there is a hardware fault in a physical implementation of the model. The bottom node of the network is the root node; it is has no inputs, its logic gate always outputs true, and it is initially a negative Dnode. The maximum depth of the network is equal to the number of bound input and feedback variables plus the root node. Fig. 4 illustrates a possible AA3 configuration. Each node repre-sents a conjunction of a set of variables. The symbol at the top of the node is the polarity and node indicator. The 16 possible outputs of the network in Fig. 4 are give in Table I. Note that although an instance 1234 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 TABLE I NETWORKF UNCTIORNE PRESENTATION A B C D output 0 0 0 0 1 0 0 0 1 1 0 0 1 0 1 0 0 1 1 1 0 1 0 0 0 0 1 0 1 0 0 1 1 0 1 0 1 1 1 1 1 0 0 0 0 1 0 0 1 0 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 0 1 0 1 1 1 0 0 1 1 1 1 1 set represents a partial function, an actual AA3 network represents a total function on those inputs that are part of the network. IV. THE AA3 LEARNINAGLG ORITHM In this section we first discuss the architecture that supports the learning algorithm and then the learning algorithm itself. A. Architecture When the system receives a new instance that contains a new input variable, then the input binder of Fig. 1 allocates an input line for the new variable. When the system receives a new instance the adaption unit of Fig. 1 broadcasts to the logic network the variables and polarity of the new instance. This information allows all nodes within the network to work cooperatively and in a distributed fashion. The node of Fig. 2 contains a control unit able to execute the learning and deletion algorithm. The control unit is also able to send messages to its node child and to its siblings ( if they exist). We emphasize that the network does not store the original instance set. Indeed, as the example in Section V shows, it is usually logically impossible to reconstruct the instance set from the network. B. The Learning Algorithm We describe the AA3 learning algorithm that tells how a consistent network reconfigures itself when faced with a new instance. At the completion of the AA3 learning algorithm ( and at the completion of its deletion algorithm) the network is still consistent and represents the functionality of the previous network coupled with new information from the new instance. Each node has a type ( Dnode or Pnode), polarity, and variable list, labeled as node. type, node. polarity and node. variables respectively. Node. polarity is null for a Pnode. When the system receives a new instance, the AU broadcasts to each node the instance. variables and the instance. polarity of the new instance. Each node then independently follows the following learning algorithm. ( 01) if ( node. type = D) and ( 02) ( 03) ( 04) ( instance. polarity < > node. polarity) and there is no discriminant variable between instance. variables and node. variables then if ( node. variables is a proper superset of instance. variab1es) then ( 05) polarity- inversion( n0de) else begin ( 06) ( 07) DVA ( node, S) ( 08) Self- Deletion () S := instance. variables - node. variables end; end C. Remarks Line ( 01)-( 03): Only a Dnode that has opposite polarity to the new instance and that cannot be discriminated from the new instance ever " learns" ( is modified). Line ( 04)-( 05); If a node has the same or more variables than the new instance, then the new instance directly contradicts the node for all active states. The contradiction will disappear if the node changes its polarity to that of the new instance. Polarity inversion flips the polarity of the node and redirects the node's output to the opposite collector. Line ( 06): Since instance. variables is always non- empty and since it failed line ( 04), some instance. variable is not a node. variable. Therefore, the set S is not empty. For each variable in S, the new instance contradicts the node for some state. Therefore, for each such variable we add two nodes to the network to resolve this contradiction, We do this recursively through the procedure DVA. Line ( 07): Informally, the recursive procedure DVA takes a variable T from S, wires in two new parent nodes for S, deletes 1 ~ from S, changes the old node to a Pnode, and recursively calls itself for the concordant parent node if there still are some variables left. More formally, Procedure DVA ( node, 5); ( 09) Allocate ( node 1); Allocate ( node 2); ( 10) Set 1. to an element of S; ( 1 1) nodel. polarity := node. polarity. nodel. child := complement of I nodel. type := D; ( 12) node2. polarity := instance. polarity, node2. child := 1.; node2. type := D; ( 13) node. type := P; ( 14) if IS1 > 1, then DVA ( node2, S - 1.); D. Remarkr Line ( 09): Node1 and node2 are the new parent nodes. Line ( IO): The order of variables chosen is inconsequential Line ( 11- 12): The new parents become Dnodes of opposite polarity, each differing in node. variables only by the discriminant variable I - . Line ( 13): Since node is no longer a Dnode, change its type to a Pnode. Line ( 24): If S has more than one element, then recursively call DVA for node2 and S - I-. We give an example of DVA. Consider the positive Dnode of Fig. 5 with variables - 4- B confronting the new instance ,1- BCD * - Z. The node executes the learning algorithm. The node is a Dnode, has opposite polarity to the new instance, and has no discriminant variable with respect to the new instance. Since A N B is not a superset of - 4- BC D, the set of instance. variab1es- node. variables is { C. D}. D1-- 4 is called twice. Assuming the discriminant variable C is chosen first, Fig. 6 shows the modification after one DVA recursion, and Fig. 7 the final reconfiguration after both. All DVA modifications take place independently and in parallel. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 1235 A Fig. 5. Initial positive Dnode. t T -€ C Fig. 6. After one DVA. b\ ,/$ c - c C Fig. 7. After complete DVA T T Fig. 8. Initial network section. D Fig. 9. Final network section after self- deletion. The final step of the algorithm is self- deletion. Each Dnode has a unique sibling. At the end of the learning algorithm, each node independently executes the following deletion algorithm. ( 15) Self- Deletion ( 16) If ( node. type = D) and ( 17) ( node. polarity = sibling. polarity) then begin ( 18) Inform- child( node) ( 19) Self- Delete( node); Self- Delete( sib1ing). End; End; Lines ( 15)-( 19). Sibling Dnodes that have the same polarity are superfluous; if their child node fires, then one of the two nodes must fire with their common polarity. Therefore, delete both nodes and make their child node a Dnode of the same polarity as the parents. This procedure is then recursively initiated by the new Dnode with its sibling. For example, assume initially the section of network shown in Fig. 8. Assume that the new instance - A- BE =+ 2 is broadcast. Nodes 1 and 6 are the only discordant Dnodes. Node 6 is discriminated by variable B. Node 1 is superset so it does polarity inversion, becoming a positive Dnode. Nodes 1 and 2 are both positive Dnodes and they self- delete, causing node 3 to become a positive Dnode. At this point Fig. 10. Initial network configuration. nodes 3 and 4 are both positive Dnodes and they self- delete causing node 5 to become a positive Dnode. Since the sibling of node 5 ( node 6) is a negative Dnode, no more self- deletion occurs in this section of the network. The final network section after these modifications is shown in Fig. 9. Like DVA, self- deletion occurs independently and in parallel throughout the network. v . ILLUSTRATION OF THE DISTRIBUTEMD ECHANISM In this section we illustrate each aspect of AA3 with an example. The example demonstrates that the original instance set may be distributed throughout the system and that the original instance set need not be recoverable from the network. We start the network in the null state of Fig. 10. We describe the evolution of the network as seven instances are input. Instunce I - A- BC =+ - 2 ( negative): The root node begins as a negative Dnode. Since the initial network has no positive Dnodes, no matching occurs. The network remains as given in Fig. 10. Instance I1 - - ABDE =+ - Z ( negative): Since Fig. 10 has no positive Dnodes, the network remains unchanged. Instance Ill - BDE =+ - Z ( negative): Since there still are no positive Dnodes in Fig. 10, the network remains unchanged. Instance N - ABC =+ Z ( positive): Since the root node has no variables, there is no discriminant variable for the root node and the new instance. Since ABC is a superset of the variables of the 1236 IEEE TRANSACTIONS ON SYSTEMS. MAN. AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 Fig. 11. Modified network t t Fig. 12. Modified network root node, a DVA is done for each of the variables A. B. C. If the DVA is done in alphabetical order, then Fig. 11 is produced. Since no self deletion is possible, the final network configuration remains as in Fig. 11. Instance V - -- 4D + 2 ( positive): The variables - AD are compared with the variables of the three negative Dnodes ( 2), ( 4), ( 6). - 4 is a discriminant variable for node ( 4) and for node ( 6). Node ( 2) and the - TI do not share a discriminant variable. The variable list --- ofI n ode ( 2) is a subset of the variable list -,- ID of the - 1- 1. Therefore, DVA is done at node 2 with the variable D. Fig. 12 gives the network. Since no self- deletion is possible the network remains as in Fig. 12. - 4- B- C are compared with the variables of the positive Dnodes ( 5) and ( 8). C is a discriminant variable for node ( 5); is a discriminant variable for node ( 8). Since there are no positive Dnode matches, the network remains unchanged. The S I is already fulfilled by the network. Instance VI/ - B + Z ( positive): The variable B is compared with the variables of the negative Dnodes ( 4), ( 6), and ( 7). B is a discriminant variable for node ( 4). Neither nodes ( 6) nor node ( 7) have a discriminant variable for B 3 2. The variables of node ( 6), AB - C, are a superset of the 3- 1. Node ( 6) therefore undergoes polarity inversion. Since the variables of node ( 7) are not a superset Instance VI - .- I - B - C + - 2 ( negative): The variables - A A Fig. 13. After polarity inversion and DVA ? r of the SI, DVA must be done. DVA is done for each variable in B 3 2 that does not appear in A- D, namely for B alone. Fig. 13 gives the network. Self- deletion is now possible. Nodes ( 5) and ( 6) are siblings of the same ( positive) polarity; they delete themselves; their child, node ( 3), becomes a positive Dnode as in Fig. 14. Self-deletion continues. Nodes ( 3) and ( 4) are siblings, but have opposite polarity. Nodes ( 9) and ( 10) are siblings, but have opposite polarity. There are no other siblings; the self- deletion stops. The final network is that of Fig. 14. Note that the network fulfills the instance set with a distributed mechanism. Indeed, no single node is responsible for the final instance B 3 2. The responsibility is spread across the three positive Dnodes ( 3), ( 8), and ( 9). One of these nodes is active whenever B is true, depending on the value of the other inputs, thus fulfilling the instance. VI. MULTIPLEO UTPUTS Having discussed the architecture and learning and deletion algo-rithm for a single output, we extend to multiple outputs. We first discuss the changes to the architecture and then the changes to the algorithms. Architecturally, a node has an additional polarity flag for each output variable for which it is a Dnode. Each output variable has its own positive and negative collector. A node could be a positive IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBERIOCTOBER 1991 1237 Dnode for one variable, a negative Dnode for another variable, and a Pnode for a third variable. During any learning cycle, the AU sends three items: the polarity of the instance, its variables, and the output variable name. Each node must check whether it is a Dnode for the output variable of the new instance. During DVA, a new Dnode must also set the corresponding polarity flag for the current output variable. If a node is being used for other variables, then when told to self- delete it simply sets its current output variable flag to nil. If a node is no longer being used for other variables, then when told to self- delete it can do a true node deletion. The real power and efficiency of the system becomes evident with multiple outputs; sharing of network nodes can be done with multiple outputs, leading to more efficient use of hardware. VII. FREEDOMFR OM EXPONENTIACLO MPLEXln The majority of current connectionist models assume an initial fixed number of nodes and a static interconnect where the dynamic aspect of the network is in the weights on links between nodes. The ASOCS model assumes a dynamic structure where the number of nodes may increase or decrease and links between nodes are also dynamic. ( Efficient implementation technologies to allow dynamic structure are mentioned below.) The main advantage of a dynamic structure is the potential for the model to solve complex functions without necessity of exponential space or time demands. For example, assume a static binary decision tree ( BDT) that is universal for 20 input variables. By universal it is meant that it will be able to solve72any of the possible Boolean functions of 20 variables. There are 22 functions of r i variables and in this case the BDT would have to have 2" or 1 000 000 nodes in order to guarantee representation of an arbitrary function of 20 inputs. As can be seen, the number of nodes grows exponentially. It appears that any static neural network model that guarantees arbitrary function learning will require an exponential amount of space whether it be in number of nodes, number of links, resolution of weights, etc. Use of a dynamically structured neural network allows models that guarantee learning of complex functions without requiring exponential space. There are random functions that appear to always require expo-nential demands, such as recognizing white noise on a raster screen. However, these types of applications are expressly outside of the ap-plication domain targeted by both artificial and natural neural systems [ l l ] . The application space for which neural networks and ASOCS are targeted feature input/ output mappings where generalization and minimization can take place, thus allowing a parsimonious network solution. However, since the specific mappings are not known U priori, it requires a dynamic network structure in order to take advantage of this occurrence. For example, in representing a Boolean function of 20 variables with a BDT, some branches of the tree may be of length 20, while the majority, when minimized, may be much shorter. The dynamic structure accommodates those parts of the network requiring the full complexity, while requiring only sufficient nodes for the rest of the network. There are a number of ways to implement a logically dynamic network. One model of AA3 uses small BDT's, with a maximum depth of say 10. Complex connections exceeding 10 variables pass through a dynamic router into another 10- depth AA3 module. Extra modules are thus only used where required. Another class of mech-anisms uses a logically independent network with a single network node representing a Dnode, with the nodes connected to a broadcast topology [ 13], i. e., tree, mesh, optical, etc. This allows dynamic logical structure while maintaining parsimony of node usage at an implementation level. VIII. SIMULATIOANN D COMPARISOWNI TH Two OTHER ALOGRITHMS Software simulation of AA3 indicates that each instance generates two nodes on the average [ 6] for a single variable output. As discussed in Section VI, this statistic should improve with multiple variable outputs. AA3 improves AA1 [ 8] in two ways. 1) Adaption unirfunctionality: In AA1 the adaption unit must store and maintain a consistent instance set. In AA3 the adaption unit merely broadcasts the instance to the network; the network handles storage and consistency in a distributed manner. 2) Memory requirements: In AA1 the memory requirement per node is proportional to the product of the instance set size and the number of output variables. In AA3 a single variable list is stored at each node, and 2- bits are required for each output variable that a Dnode defines. Although AA3 is similar to AA2 [ 6], [ l l ] , it improves AA2 in two significant ways. 1) Simpler learning algorithm: AA2 does comparison with all nodes, building a node that exactly matches each new instance. AA3 matches only with discordant Dnodes, and requires only that the network can fulfill the instance set. 2) Ease of implementation: AA2 requires dynamic interconnect between network nodes. AA3 uses a fixed interconnect model, with improved potential for VLSI design. IX. CONCLUSION This paper introduces adaptive algorithm 3 ( AA3) for adaptive 1) guaranteed mapping of arbitrary Boolean functions, 2) bounded linear learning time ( logarithmic with the number of nodes) 3) stability of previously learned patterns, 4) ability to extract critical features from a large environmental input. self- organizing concurrent systems. It features the following: AA3 implements an ASOCS model with: 5) negligible memory requirements, 6) distributed storage and maintenance of the knowledge base, 7) a simple learning algorithm, 8) a fixed interconnect. New models that allow simpler implementation and a more robust instance mechanisms are now being proposed. In order to give the model expanded utility in real- world applications, current research thrusts include: extension of ASOCS data and functional primitives to higher order structures ( including analog and multistate variables), investigation and enhancements of the ASOCS feedback mech-anism to allow temporal dynamics and sequential algorithms, new models with improved speed, programmability, and fault tolerance, improved generalization mechanisms for handling inputs for which no explicit training has taken place. REFERENCES [ I ] J. Chang and J. J. Vidal, " Inferencing in hardware," in Proc. MCC- Univ. Res. Symp., Austin, TX, July 1987. 121 L. S. Haynes, R. Lau, D. Siewiorek, and D. Mizell. " A survey of highly parallel computing," Computer, vol. 15, no. 1, pp. 9- 24, 1982. [ 3] J. J. Helly, W. V. Bates, and S. Kelem, " A representational basis for the development of a distributed expert system for space shuttle flight control," NASA Tech. Memo. 58258, May 1984. IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. 21, NO. 5, SEPTEMBEWOCTOBER 1991 K. Hwang, " Advanced parallel processing with supercomputer architec-tures," Proc. IEEE, vol. 75, pp. 1348- 1379, 1987. T. Kohonen, Self- Organization and Associative Memory. New York: Springer- Verlag, 1984. T. R. Martinez, " Adaptive self- organizing logic networks," Ph. D. dis-sertation, Tech. Rep. CSD 860093, Univ. Calif., Los Angeles, May 1986. - , " Adaptive self- organizing concurrent systems," in Progress in Neural Networks, vol. 1, 0. Omidvar, Ed. Nonvood, NJ: Ablex, , T. R. Martinez and J. J. Vidal, " Adaptive parallel logic networks," J. Parallel and Distributed Computing, vol. 5, no. 1, pp. 26- 58, 1988. T. R. Martinez and D. G. Campbell, " A self- adjusting dynamic logic module," J. Parallel and Distributed Computing, vol. 11, no. 4, pp. T. R. Martinez, " Self- organizing binary decision trees: Towards VLSI connectionist computing," Int. J. Computer- Aided VZSI Design, to be published. - , " Neural network applicability: Classifying the problem space," in Proc. LASTED Int. Symp. Expert Systems and Neural Networks, pp. 4144, Aug. 1989. F. Rosenblatt, Principles of Neurodynamics. Washington, DC: Spartan Books, 1962. G. Rudolph and T. R. Martinez, " DNA Towards an implementation of ASOCS," in Proc. IASTED Int. Symp. Expert Syst. and Neural Networks, pp. 12- 15, Aug. 1989. D. Rumelhart and J. McClelland, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol. I. Cambridge, MA MIT Press, 1986. R. A. Verstraete, " Assignment of functional responsibility in percep-trons," Ph. D. dissertation, Comput. Sci. Dept., Univ. Calif., Los Ange-les,, June 1986. S. S. Yau and C. K. Tang, " Universal logic circuits and their modular realizations," in AFIPS Con$ Proc., vol. 32, pp. 297- 305, 1968. C. Barker and T. R. Martinez, " Proof of correctness for ASCOS AA3 networks," to be published. ch. 5, pp. 105- 126, 1990. 303- 313, 1991. the " actual" but unknown probability distribution over the set of events ( states, conditions) in terms of which the problem is defined. However, the probabilistic information available for decisions under risk and uncertainty may also be characterized in this way. For decision under risk, the set li is a singleton: Ii = { p } . For decision under uncertainty, I< is the entire simplex of probability distributions over the event space of the problem. This perspective facilitates a unified approach to decision making using various forms of probabilistic information. Here, decision problems are considered with the following com-ponents: a set of possible acts A = { a1 .... . am}, a set of pos-sible states ( or events) S = { SI,. . . , s,,}. and a utility function U : S x A + R, where S is the Cartesian product of a ( finite) set of finite variable domains: S = dom( l/,) = x, cc, dom( v). Probabilities p ( s J ) are determined only to the extent to which they may be inferred from a given collection of marginal probability distributions defined on Cartesian products of the domains of subsets of some set V of variables such that, usually, V, In general, the marginals determine a nonsingleton proper subset I< of Pv, . the set of all possible distributions over S ( unconstrained by compatibility with any given set of marginals), any member of which could be the actual distribution. Thus, the type of decision problem under consideration is one of decision making under partial uncertainty proper, although it may in special cases ( due either to the structure over which probabilities are available and its relation to the set S or to the quantities involved) reduce to one of decision making V. Decisions with Probabilities over Finite Product Spaces Michael Pittarelli Abstract- Techniques for decision making with probabilities over finite product spaces are discussed. In general, the type of decision problem generated by the available probabilistic information is one of decision under partial uncertainty: the probability distribution over the event space for the problem is determined only to the extent that it is contained in a convex polyhedron of distributions. The structure of this set makes computationally feasible the application of any of the various criteria for decision making with indeterminate probabilities that have appeared in the literature. Algorithms are developed for economically reducing the size of sets guaranteed to contain the unknown distribution over the event space for a given problem, thereby improving the quality of the decision made using any criterion. under risk or under uncertainty. The restriction that the set S of relevant events be a Cartesian product of finite variable domains is not as severe as it might at first I. INTRODUCTION Over the past 30 years, many authors have found it useful to classify decision problems into three types: decision under risk, decision under uncertainty, and decision under partial uncertainty. Partial uncertainty is usually characterized as involving knowledge of a set of distributions li such that any element p of li is potentially Manuscript received April 1, 1990; revised April 12, 1991. The author is with the Department of Computer and Information Science, State University of New York Institute of Technology, Utica, NY 13504- 3050. IEEE Log Number 9101212. seem. The variables v E V,, may represent attributes in terms of which a collection of entities is classified, as in the relational model of data [ 12] or in statistical analysis of categorical variables [ 5]. The collections of marginals available for a given decision problem are themselves treated as probabilistic databases [ Z] here. They are manipulated via an algebra analogous to the relational algebra for relational databases in order to reduce the size of the set li of distributions over the set r/, compatible with the given marginals, while at the same time keeping the computational expense reasonably low. The effect of the reduction in size of K is to increase the likelihood that a single best action ( relative to many different types of criteria) will be identified, thereby overcoming to the extent possible what may be viewed as the " imperfection," relative to the given decision problem, of the available data [ 14]. A simple algebra of probability over finite product spaces is presented in Section 11. 11. NOTATIONA ND ALGEBRA A set of variables I.' = { V I . . . . . v k } over which a probability distribution p is defined is referred to as the scheme for p. A collection P = { pl , . . . , p,} of probability distributions over schemes of finite variables will be referred to as a ( probabilistic) database [ 2]. The database P = { p . p,} has the strucfure X = { VI,. . . , IT,,,} w, here V, is the scheme for distribution p,. Let dom( X) = dom( V1 U . . . U V,). ( As in relational database theory, some arbitrary but fixed linear ordering on the variables is assumed.) 0018- 9472/ 91$ 01.00 0 1991 IEEE
Click tabs to swap between content that is broken into logical sections.


text:
Basic Internet Searching
Submitted by site_admin on Wed, 01/23/2013 - 11:33am
Basic Internet Searching
February 19th at 6:30
Want to learn how to find the information you need on the Internet? This is the class for you! Call the library at 330-343-6123 to register or for more information on this free class.
Tuesday, February 19, 2013 - 6:30pm

subset: commoncrawl


text:
Products Details
Rocky Mountain Hardware C455
Cross Arm Chandelier with Square GlassRocky Mountain C455 - Square Glass-Shown with the G4513 5 1/2" x 13" rectangular ceiling escutcheon in silicon bronze, rust patina -Available with G4513 Rectangular Escutcheon or E153 Rectangular Designer Escutcheon -Weight: 50 lbs -Specify fixture lengths. The maximum standard length is 8'. Please specify if additional length is needed. -Fixtures are UL rated for indoor and outdoor damp locations. -Price includes glass shade (Globe 004) -Requires 4 incandescent or compact fluorescent type A bulbs (bulbs not included). -100 watts maximum. Add To Favorites starting at $6,970.00 Price shown is manufacturer's FULL LIST PRICE. Submit your order as an estimate in our shopping cart, send us an email or contact us by phone to receive your discounted price.To customize, follow the steps below purchase Options |


text:
Quick Facts
- NAME: Sherman Hemsley
- OCCUPATION: Television Actor
- BIRTH DATE: February 01, 1938
- DEATH DATE: July 24, 2012
- PLACE OF BIRTH: Philadelphia, Pennsylvania
- PLACE OF DEATH: El Paso, Texas
Best Known For
Actor Sherman Hemsley played the popular television character George Jefferson in All in the Family and The Jeffersons in the 1970s and 1980s.
Think you know about Biography?
Answer questions and see how you rank against other players.
Play NowSherman Hemsley. (2014). The Biography Channel website. Retrieved 03:56, Mar 09, 2014, from http://www.biography.com/people/sherman-hemsley-20892573.
Sherman Hemsley. [Internet]. 2014. The Biography Channel website. Available from: http://www.biography.com/people/sherman-hemsley-20892573 [Accessed 09 Mar 2014].
"Sherman Hemsley." 2014. The Biography Channel website. Mar 09 2014, 03:56 http://www.biography.com/people/sherman-hemsley-20892573.
"Sherman Hemsley," The Biography Channel website, 2014, http://www.biography.com/people/sherman-hemsley-20892573 [accessed Mar 09, 2014].
"Sherman Hemsley," The Biography Channel website, http://www.biography.com/people/sherman-hemsley-20892573 (accessed Mar 09, 2014).
Sherman Hemsley [Internet]. The Biography Channel website; 2014 [cited 2014 Mar 09] Available from: http://www.biography.com/people/sherman-hemsley-20892573.
Sherman Hemsley, http://www.biography.com/people/sherman-hemsley-20892573 (last visited Mar 09, 2014).
Sherman Hemsley. The Biography Channel website. 2014. Available at: http://www.biography.com/people/sherman-hemsley-20892573. Accessed Mar 09, 2014.
Born in 1938, Sherman Hemsley served in the U.S. Air Force and worked for the U.S. Postal Service before becoming an actor. He made his Broadway debut in 1970 in the musical comedy Purlie. In 1973, Hemsley joined the cast of All in the Family as George Jefferson. He reprised this role on The Jeffersons from 1975 to 1985. Hemsley continued work steadily in television through the 1990s. He died on July 24, 2012.
Early Life and Career
While best known for his television work, Sherman Hemsley had started out as a stage actor. He grew up in Philadelphia, dropping out of high school to enlist in the U.S. Air Force. He served in Japan and Korea before returning to the states. After his military career ended, Hemsley worked for the U.S. Postal Service. He started studying acting in his spare time.
In the late 1960s, Hemsley appeared in several off-Broadway productions before his big break. He landed a supporting role in the Broadway musical comedy Purlie with Melba Moore and Cleavon Little, which began its run in 1970.
Iconic Character
In the early 1970s, Hemsley made the switch to television, joining the cast of All in the Family. The sitcom, created by Norman Lear, starred Carroll O'Connor as the conservative and bigoted curmudgeon Archie Bunker. Hemsley and Isabel Sanford played Bunker's African-American neighbors, George and Louise "Weezy" Jefferson. Mike Evans played their son Lionel. George Jefferson, stubborn and equally opinionated, proved early on in the show that he could hold his own with Archie Bunker. Hemsley managed to imbue the outspoken character with warmth and depth, preventing him from appearing cartoonish or too over the top. He and Sanford also had great chemistry—Weezy and George became one of television's most beloved couples.
Before long, the Jefferson family earned their own show. The Jeffersons debuted in 1975 with perhaps one of the catchiest and most quotable television theme songs of all time "Movin' On Up." As the song goes, George and Weezy Jefferson moved "to a deluxe apartment in the sky" in this All in the Family spinoff. George's business had become so successful that the couple could move away from the old neighborhood. They even had Florence (Marla Gibbs) as their maid to take care of the place. While the show initially faltered in the ratings, the new comedy soon found its audience. People tuned in week after week to watch George lose his cool with his neighbors or over some other type of frustration.
Later Career
After The Jeffersons ended in 1985, Hemsley soon landed another leading comedy role on television. He starred as Deacon Ernest Frye on Amen, a sitcom about a Philadelphia church. Much of the show's comedy was derived from Frye's interactions with his colleague, Reverend Reuben Gregory (Clifton Davis), as well as with his congregation. Lasting for five seasons, Amen ran from 1986 to 1991.
Hemsley continued to work during the rest of the 1990s. He lent his voice to one of the characters on The Dinosaurs from 1991 to 1994 and made guest appearances on such shows as Sister, Sister.
profile name: Sherman Hemsley profile occupation:
Your Connections
Sign in with Facebook to see how you and your friends are connected to famous icons.
Profile Connections
Included In These Groups
Black Comedians
From the early comedy of Nipsey Russell, Richard Pryor and Bill Cosby to the contemporary routines of Steve Harvey, Mo'Nique, Chris Rock, Wanda Sykes, Craig Robinson, Maya Rudolph and Dave Chappelle, black comedians have often used their wit to become the voice and face of the African-American experience. These legendary comedians have also set a very high bar—not only for African Americans, but for all comics trying to make it in show business. Learn more about these famous jokesters, from their early days to their comic beginnings, to their side-splitting performances and more.
Black Comedians 36 people in this group
Famous Aquarians 598 people in this group
Famous Actors
Browse notable actors such as Woody Allen, John Belushi, and Steve Buscemi.
Famous Actors 1024 people in this group


text:
Arriving at the bus station!
Is there storage for luggage, my B&B host is not available until Iater in the eve and I arrive in the mid afternoon! HELP! Thank you!
hop on/off buses?
I would like to take a bus from evora to faro. ive seen the bus route and would like to see the cities portel,vidigeira, and beja, which are on the bus route.can i get off at these locations then take another bus at a later time without having to pay more money?thx for all the help
i would like to visit evora-monte and the castle while i'm in evora.is there a bus to this town?i looked on line but without it being in english it is difficult for me to understand.would like to spend a hour or 2 there then go back to evora then to lisbon in same day
Seeking public transportation options traveling from Tavira to Evora on May 11, 2013.
Seeking public transportation options traveling from Tavira to Evora on May 11, 2013.
stay in Evora or outside?
we are coming by car from Castelo de Vide and will visit sites of Evora for 2 days in July. Should we stay in Evora itself or base ourselves somewhere nearby (Moura? Estremoz?) we dont want a fancy poussada ,just a nice clean little residencial.
It seems that most of the places within the city are very expensive, and the ones that arent seem to have bad reviews on here. Also is parking going to be a problem inside the city? thanks all. -
is there a covered market somewhere in evora that sell food, veggy and stuff?
I always like to visit some local market.
many questions regarding day trip from lisbon to evora
1) does the train ride to evora really take 3 hrs, if then should I catch a train from lisbon 6AM?
2) Chapel of bones, is it really worth it to go in and see? or it is just too creepy? does it cost 2 euro? or it is more like donation
3) The Roman Temple, this is just a pic taking thing right, seems not much to it
4) Cathedral, it costed 1 euro is it donation or? worth it to go in?
5) Inquisition palace , is it worth to go in? how much?
6) CIty council of Évora
Palace of Vasco da Gama
Palace of the Dukes of Cadaval
Palácio D. Manuel
Palace of The Counts of Basto
all worth it to go in or just taking pic outside?
7) Silver Water Aqueduct it seems to be outside of the town, how do I get there and back? any bus from center of the town?
8) also I heard the wines here are good too, can I easily get them from the store? how cheap is it?
9) if I get to evora by 9, what time do I need to leave if I want to see all before I leave? 6PM enough?
many thanks I know I asked a lot of question at once
7) -
Evora Bus Question
Does anyone know if there is a toilet on the regular bus from Lisbon to Evora and return? Thanks!
We are planning to visit Evora in early october, and are hoping to find a centrally located apartment to rent for about 1 week. We would prefer something that has cooking facilities. Does anyone have suggestions?
B and B or similar
I see that there a number of hotels in Evora but can anyone recommend a guesthouse type place?
If possible I would prefer something like this as I feel as if I get to see a more local side of life.We will be on public transport so that is a definite consideration
Thanks for any advice -
wall tablet
Member Search
Hi! In Evora I saw this wall tablet with a cross and two chopped arms: flickr.com/photos/63774505@N.... Does anyone know what this symbol means and on what kind of building it was?
(It probably was in the Rua Serpa Pinto.)
Thanks! -
Bus Between Seville and Evora?
Hi everyone,does anyone know if there is a bus between Seville and Evora at all? Thanks,Steven,Scotland
Traveling alone to Evora in late November..will it be cold..imean very cold?
Hi, I will be staying in Evora in late November then heading on to Sintra, Portugal. What can expect from the weather? Also is Evora less expensive then Sintra and Lisbon? Very excited about my trip. Thanks in advance
Evora to Badajoz by bus
Does anyone know how to get from Evora to Badajoz by bus? I am looking at travelling this route in April 2008 but I can't find information on bus timetables? Can anyone assist with information? I have emailed the Evora Tourist Office but have not had a reply. It may have something to do with my dodgy Portugese language skills!
Thank you. -
Travel Time & Distance to Tavira
Does anyone how far it is between Evora & Tavira. How long is driving time?
Thanks -
Help please!
Hi! I would like to ask for some help... does anyone knows how can I go from the bus station to the city center? is it a long distance walking? or do you need to catch a bus or a taxi? and my second question is about the accomodation, I ll be spending two months there, does anyone knows where can I rent a room in a share flat??? well, at the moment that´s it :S thanks for your help!
Dolmens from Evora
Could you please let me know how I can reach the dolmens from Evora? By bike? By bus?
Gabor -
Sunday in Evora
We will be arriving Saturday, probably not until around 5 and then want to tour around Evora on Sunday. What will be open? My husband especially wants to see the Chapel of Bones. Will we be able to get into the Chapel -- or will it be closed for Mass in the Church?
Pleaseee Help!!! From Evora to Cordoba?
Hello guys!!! I was wondering if theres a trasport... bus/train from Evora to Cordoba, does anybody know anything about this? thanks :)
Evora to Seville
I'm on my third try for organising my trip. Does anyone know it's possible to catch a bus or train to Seville from Evora. I've searched and searched and can't find a thing.
Cheers -
Transport to Tavira
Can anybody please suggest the best way to get from Evora to Tavira. It seems that Eva buses can do it via Lisbon and Faro but as I don't want to back track if I can help it.
Can I catch a train to Faro via Beja and then bus from the train station to Tavira? If so how do I organise this?
Any other suggestions would be appreciated
Thankyou -
Hotel Review
I am travelling to Portugal in June and hope to stay for a few days in Evora. Has anyone stayed in Hotel Solar de Monfalim, it looks traditional and in a good location but can't find any reviews.
Any ideas for' must sees' or unusual places to visit in the area. Is it easy to drive to other destinations in Alentejo?
Obrigado -
Trains between Evora and Spain??
Hi all,
I'm going to be in Islantilla, Spain for a week and would like to pop up to Evora for a night.
I was told that it's about a 2 hour drive, is this accurate?
Also, I've been trying to look up train timetables in both the Spanish and Portugese sites but can only check national timetables.
Does anyone know if it's possible to travel from Islantilla to Evora by train or bus?
I'd really, really appreciate it if anyone could help me!!
Marianne. -
We are going to be in Evora in September and need some help.
Does anyone know anything about Albergaria Vitoria Hotel in Evora?? It is a small one with only 48 rooms and I cannot find out much about it.
Thank you Vters. Esther & Mike -
Getting to Evora
We're considering Evora as a short-break destination (coming from London) to celebrate my wife's birthday early next month. Do any travellers who know it have advice on: - 1) whether they think this a good idea; 2) getting there from Lisbon (train? bus? hire car?); 3) mid-range accommodation; 4) and/or unmissable places to see and in which to eat? Many thanks in advance for any and all tips, Robin
Overnight within the city walls
My mother and I will be in Evora on a Friday in September. We would like to stay within the city walls The Pousada dos Loios is over 200 euro a night which is more than I want to spend. Any other suggestions for a place to stay? Obrigada
faira alternativo?
hey, a couple of years ago i was traveling trough portugal and living in oporto, once i went to a "feira alternativa" in evora, it was a kind of alternitive festival and met lots of great people, i think it was around september, after that we all went to sintra. I would like to know the exact dates if it still exists, so maybe i come again this year. thnx n grtz, kim
Information on Evora
Just contact me for further information on this beautiful town. cheers
Room in Évora
Hi, I'm looking for a room or a small apartment in Évora for 5/6 months (feb-july) for a girl. Do you know any room/flat for rent? cheers, Ben


text:
Access the Global Review here:
Welcome, guest
Mon Mar 23, 2009
Commodity prices remained range-bound, but the ASTMAX Commodity Fund gained 11.96% for the month, as the yen weakened against the US dollar....
Subscribers have unlimited access to all current content, including hedge fund performance Live League Tables. Start your subscription today - click on the button below.
Subscribe now
Sorry, you are not allowed to print this article.
Please contact us if you have any enquiry:Email: firstname.lastname@example.com
Call: UK & EMEA +44 (0) 20 7779 7339Americas +1 212 224 3067 Asia-Pacific +852 2842 6953


text:
Sign up to receive information about new books, author events, and special offers.
Chuck Whitlock is a nationally recognized investigative reporter whose investigations into white-collar crime and exposes of nursing home and Medicare irregularities have garnered him national recognition. A tireless scambuster and consumer advocate, he has appeared on such television shows as Oprah, Hard Copy, and Regis and Kathie Lee. He is currently in negotiations with Fox to air his TV show, Crimeline. Whitlock is also the author of five previous books. He lives in southwestern Washington State.
Chuck Whitlock


text:
Men's Health Magazine: Dirty Truths About HospitalsCHARLOTTE, N.C. - You go to the hospital to get healthy, but what you're exposed to while you're there can make you even sicker, according to Men's Health Magainze. The latest issue exposes the dirty truths about hospitals. Editor, Peter Moore, gives Derek James the scoop on their findings. |
Most Popular |


text:
Mack Henry Mitchell
Position: DE
Height: 6-8 Weight: 246 lbs.
Born: August 16, 1952 in Diboli, TX
College: Houston (school history)
Drafted by the Cleveland Browns in the 1st round (5th overall) of the 1975 NFL Draft.
Weighted Career AV (100-95-...): 17 (5231st overall since 1950)
Like this page? Sponsor it for $5. Your message will replace this ad.


text:
Garden of Life Organic Super Seed® Whole Food Fiber Bars Apple Cinnamon -- 12 Bars
Adults: Stick with Super Seed powder
I think these bars contain WAY too much sugar and carbohydrates for such a small amount of fiber, plus they contain soy and wheat, which Garden of Life's Super Seed powder doesn't. The powder is far superior from a nutritional point of view, not to mention half the price for about 5 times the number of servings. Plus the powder has quite a pleasant taste, especially when added to smoothies. But for kids & other folks who just won't use the powder or get fiber & seeds any other way, the bars are definitely cleaner than most of the other bars out there.
May 15, 2013
Yummy and jampacked with good nutrients!
I like these and actually enjoy eating them.
March 8, 2013
My 16 year old daughter loves these! She says she feels like she is having an apple muffin for breakfast. Finding healthy options for our teenagers is not an easy thing to do so I am thrilled that she enjoys these so much and can run out the door to school with a nutrition packed bar!
December 29, 2012
We tried these because they were cheaper than the raspberry. They'er OK but we still prefer the taste of the raspberry better.
May 11, 2011
super great product
I really enjoy these bars. They have a good flavor to them and they are packed with nutrients which I like. I like ti use them as a healthy snack when I am away from home
April 14, 2011


text:
Added to Bag!
We'll let you know if it's back in stock!
Added to Wishlist!
Statement of the Art Necklace in Sun
Final Sale: This item cannot be returned or exchanged.
- Lead- and Nickel-free Brass, Acrylic.
- Chain measures 18.5 inches in length. Beading measures 13 inches in length and 4.25 inches in width.
- Imported


text:
Drag Queens and Gay Marriage Featured in R. Crumb's Axed 'New Yorker' Cover
Robert Crumb, the alt-comic writer with a piggyback fetish, has always been ahead of his time. That's what made his comics–usually featuring giant Amazonian women with humungous thighs as a chronic masturbatory fantasy– so transgressive to begin with.
But for all his former subversiveness, Mr. Crumb is pretty mainstream nowadays. Maybe not New Yorker mainstream though: Vice magazine unearthed a 2009 drawing from the cartoonist that was rejected by David Remnick's magazine. Though an answer was never given on why the cover wasn't run, Mr. Crumb suspects it was because the New Yorker was too afraid of offending people with the image of a (possible?) drag queen and a twee person of unidentifiable sex trying talking to a sweating official from the marriage license bureau, with a sign pointing to a "Genders Inspection" office next to his window.
Below, a high res image of the cartoon, which was discovered at the Venice Biennale in June. Read More


text:
Rebecca (Becca) Sears
Patti McGill Peterson Center for International and Intercultural Studies
During my fall semester of 2011, I studied abroad in Rouen, France. I was fortunate to live, and form close bonds, with two different host families (one in the countryside and one right in the city of Rouen). As a French major, the full immersion into French speaking families was extremely beneficial. To my advantage, though it at first felt like a disadvantage, my primary host family in the city didn't speak a word of English, so my French speaking and comprehension abilities greatly improved.
France is renowned for its diverse wines. Each region of the country has different types of grapes and styles of production, contributing to the variety of tastes unique to these regions. Some well known areas include Bordeaux, famous primarily for their red wines, and Champagne, known for, well, champagne. My initial plan was to visit the Languedoc-Roussillon region in the southwest of the country, a major producer of table wine, but because of traveling and time concerns, I instead went to the Alsace region in eastern France. I did some research prior to my trek east, and planned to visit a small, local family owned winery. I was interested in finding out how, in a country full of internationally exported wines, a local winery stays afloat amongst the competition.
I made the trip to Alsace during my fall vacation at the end of October. At that point, not much wine production was going on, but sales were (as always) in full swing. My mother joined me on this trip, which was good, because I do not know how to drive a manual car, which is the norm in France. On our way east, we drove through and spent a night in Reims, on of the commercial centers of the Champagne region. Several champagne companies have their caves there, including Moet & Chandon, Veuve Cliquot, and Pommery. My mom and I took a tour of the Pommery cellars, which was a truly fascinating experience. We were given a full tour of the caves and saw thousands of aging champagne bottles. We learned about the production and bottling processes, as well as the history of Madame Pommery. To conclude our tour, we were given a couple of glasses of free samples of different varieties of champagne. I learned the differences between a blanc de noirs, a blanc de blancs and the different types of sweetness.
We arrived later that day in the small town of Colmar in Alsace. The hills were covered with rolling vineyards of different shades of gold that seemed to go on forever. It was truly breathtaking. Due to its proximity to the border of Germany, there is a strong German influence in the buildings and local cuisine. As there are countless small wineries, it was difficult to which one to visit.
On the way back from a day trip to a castle, my mom and I took a wrong turn. While turning around in a tiny village, we stumbled upon a winery that seemed to fit my requirements of being small, local, family owned and off the beaten path. We walked up the driveway, and a bell was tripped. A short, stout woman came running from her garden to greet us. She didn't speak a word of English. I told her about my project and she was very excited to help. I was able to ask her some questions I had prepared in advance. The woman was the owner of the vineyard which had 6-7 employees. They picked the grapes mostly by hand, but used some machines to speed up the process. I asked if she sold her wine to a local restaurant, as many small wineries do, and she said that she used to, but that the restaurant had closed down. Her clientele is primarily made of up friends and neighbors to whom she had been selling for years, and passers-by like my mom and me. She then eagerly asked if she could show us her cellar. She led us to a small, musty basement containing four giant barrels full of white wines, the Alsace specialty. It was an interesting contrast to the vast underground tunnels at the Pommery caves. We snapped a few photos, and then went into her small office, which served as a tasting room. Alsatian wines are typically sweet, dessert wines. My mom and me were nervous, as we are both partial to reds, or more tart whites. However, this woman's wines were just right, so we bought four bottles to bring home.
I was sad to leave Alsace. It was charming and beautiful, and relatively unknown to American tourists. Although my enrichment project didn't take place in the region in which I had initially planned, I definitely got the experience I had hoped to get out of the trip. I am so appreciative of the CIIS office and generous grant donors for giving me the opportunity to explore a region that I would not have otherwise been able to explore.


text:
Dale Stephens
Founder of the Uncollege Movement
Blog Posts
Tags Education Trends
December 16, 2011
I'm not just a college dropout. I chose to leave school in fifth grade to become an unschooler -- the self-directed form of homeschooler. While my peers sat in class during middle and high school, I found mentors, organized collaborative...
Read More. see more see less


text:
South Tama, Iowa Valley school votes are Tuesday, Sept. 10
September 5, 2013 When they go to the polls on Sept. more »»
September is National Library Card Sign up Month
September 5, 2013 Do you have yours? Library Card that is! It's a brand new school year and the Toledo Library is here to help support academic achievement. At the Toledo Library, getting a free card is a snap. more »»
Iowa Valley readies for new Taam Education Center
September 5, 2013 Iowa Valley Community College District officials met in a planning session in the new Tama Education Center at the South Tama Partnership Center, 215 W. 9th St. in Tama on Tuesday, Aug. 27. more »»
Iowa Valley unveils new Tama Education Center
September 3, 2013 Iowa Valley Continuing Education has expanded Adult Literacy efforts in the Tama-Toledo area. Beginning Monday, Sept. 9, Tama Education Center will open. more »»
Iowa Valley presenta una nueva Centro de Educación Tama
September 3, 2013 Iowa Valley Educación Continua ha ampliado los esfuerzos de alfabetización de adultos en la zona de Tama-Toledo. A partir del lunes 9 de septiembre del Centro de Educación de Tama se abrirá. more »»
"Cloth bags" is Historical Society program Sept. 4
September 1, 2013 The Tama County Historical & Genealogical Society will meet at 7 p.m. on Wednesday, Sept. 4, at the Museum in Toledo. more »»
Fun and Health for All Ages Is Iowa Valley Offering
August 30, 2013 A very wise person once said, "Use it or lose it." And doctors have found the truth of this statement and that it applies to both the young and the seniors. more »»
Background checks expanded for school employees
August 29, 2013 By Joyce Wiese News Correspondent South Tama schools Superintendent Kerry Nelson provided details of a new law signed in June by Governor Terry Branstad on background checks for school districts... more »»
Iowa Valley Board approves faculty master contract
August 29, 2013 MARSHALLTOWN – The Iowa Valley Community College District Board of Directors approved a master contract with the faculty association that included a 3. more »»
Tama Public Library's Summer Reading Program ends
August 27, 2013 August 6 was our last summer reading day. more »»
Iowa Valley Community College District invites public comment
August 25, 2013 MARSHALLTOWN – In preparation for its Nov. more »»
South Tama schools open on Monday
August 22, 2013 Fall classes get underway with a full day on Monday, Aug. 26 for South Tama school students. A fall Sports Showcase is set for tonight, Friday, Au. more »»
Dousing class scheduled
August 18, 2013 MARSHALLTOWN - Iowa Valley Continuing Education is offering a unique look into the ancient practice of dousing. Visit a cemetery and find unmarked graves. more »»
Stephens, 2012 Meskwaki grads honored
August 18, 2013 Jerry Stephens and the 2013 graduates were honored at Thursday night's powwow by the Meskwaki Settlement School culture staff. Stephens was presented a blanket and medallion. more »»
Meskwaki School student wins United States House Art competition
August 17, 2013 Skylar Papakee,14, from the Meskwaki Settlement School won the 2013 Congressional Art Competition sponsored by the Members of the US House of Representatives. more »»
South Tama student numbers up slightly in 2012-13
August 16, 2013 South Tama Schools Superintendent Kerri Nelson presented the superintendent's annual report showing enrollment increasing slightly last year after a decline for some time to the school board on... more »»
Toledo Public Library Foundation – Instrumental in success of library
August 11, 2013 The Toledo Public Library Foundation was established in 1999 for the purpose of assisting the library with additional funding for projects. more »»
Dunning on U of I Dean's list
August 9, 2013 Some 4,000 undergraduate students at the University of Iowa were named to the Dean's List for the 2013 spring semester. On the Dean's List was Boston Dunning, Toledo, Liberal Arts and Sciences. more »»
Yuska, Mallory seeks reelection, no one files for District 4
August 7, 2013 Michelle Yuska, Toledo, will be seeking a third, four-year term on the South Tama School Board in the Sept. 10 school election. She will be unopposed on the ballot. more »»
Naturalization is Museum topic
August 4, 2013 The next meeting of the Tama County Historical Society will be at 7 p.m. on Wednesday, Aug. 7, at the Museum in Toledo. more »» |
News, Blogs & Events Web |


text:
I would like to change how LEDs are controlled on my RAZR-- I seem to get a flashing green light for everything so it is useless. I went through all the FAQs. Search said that "LED" was too common a word to yield results. When I looked for a forum to post in I didn't know if this is a "tech" issue (e.g. something built into the phone) or if it is an "app" issue (e.g. I need an app to adjust them). Suggestions on how to proceed would be appreciated.
Thanks in advance.


text:
Who'd want to be men of the people
When there's people like you?
Silversun Pickups - Panic Switch
They release their new album, Neck of the Woods, on May 8.
Garbage - Stupid Girl
For everyone who remembers Garbage & the 90's alt-rock scene, their comeback album comes out May 15.
Elephants - Them Crooked Vultures
Awesome live show in Reading
With green eyes and long blond hair
She wasn't wearing underwear at least I prayed that
She might be the one maybe we'd have some fun
Maybe we'd watch the sun rise
But that night I learned some girls try too hard
"You & I"
Gnarly new Arctic Monkeys song feat. Richard Hawley


text:
Make the "write" brand impression happen. 300 pens for $75.
Questions? Call 1-800-369-4669 | Live Chat |
Product Details
About this product:
This 13" Natural Kraft Shopping Bag is a traditional bag that gives your brand a classic look. Made of basic brown kraft paper, this paper shopping bag has twisted paper handles for easy carrying. With full side and bottom gussets, this custom kraft shopping bag is foldable for easy storage when it's not promoting your brand. This 13"x17"x7" imprinted paper bag is made in the USA.
This kraft paper bag serves as the perfect backdrop for displaying your company logo and message in the 9"x10" image area. Great for farmers' markets or retail shops, a logoed kraft shopping bag acts as a walking billboard for your brand. Kids will enjoy decorating custom shopping bags at your next community event or fundraiser, and customers will love receiving a durable, reusable shopping bag at a tradeshow or convention.
Rush: Call for details.
Available Design Methods
Available Design Locations
We have developed an FAQ with answers to your common questions. If you cannot find your answer, we want to hear from you.
Chat online with a representative: Online Representatives are available .
Call us at 1-800-369-4669 Phones are answered during our regular business hours of 9:00 a.m. to 6:00 p.m. Eastern Standard Time.
Email us at: email@example.com E-mails are answered during our regular business hours of 9:00 a.m. to 6:00 p.m. Eastern Standard Time.
Starting Price:
**The estimated delivery date is based on selection of UPS ground delivery.
2. Set Quantity: Minimum required for this product: 250 Lowest quantity listed is minimum quantity for design. Quantity must be a multiple of 1 when decorated.
3. Add Logo:


text:
Thread Tools | Search this Thread | Display Modes |
Join Date: Jul 2012
Location: Central City, Nebraska
Posts: 2
Dual Furnaces
This is my first of many posts and one that I really need some help understanding. I just purchased a new house. The house was built in 1910, but has had multiple add-ons done. Currently there are two furnaces, a really old one in the basement and a slightly newer but still old one on the main floor. The house is two stories and the basement is just a dirt crawl space for the most part. Furnace (basement) This furnace feeds the main floor with floor vents. Pretty straight forward and probably the original design of the heating system. Furnace (main floor) This furnaces is where I get confused. It has two primary branches off of it. The first branch goes upstairs and feeds a newer addition that was built in the 70's or 80's. The second branch feeds 3 of the same rooms that the basement furnaces feeds + 2 upstairs bedrooms. Problem and Question - What I would like to do is removed the second feed off the main floor furnace and just run smaller duct work to the two bedrooms that it feeds and stop feeding the same rooms that the basement furnace feeds. If I did this am I going to get myself in trouble with "HVAC Laws"? Why would someone design a system like this? Any advice/help would be appreciated. Mike |
Join Date: Jun 2012
Location: Augusta, GA
Posts: 369
Dual Furnaces
That's an odd setup, and there's no way for us to tell you whether your duct changes would be okay or not. You'd have to get someone onsite to review the situation before you can make that determination.
Most likely the duct systems were installed that way to alleviate hot/cold spots in those rooms, but again - there's no way to tell. |
Thread Tools | Search this Thread |
Display Modes | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Dual Stage Furnace | grod777 | HVAC | 34 | 11-05-2011 10:28 AM |
NM cable and Dual fuel range | edge130 | Electrical | 0 | 11-02-2011 03:48 PM |
Dual Cap 35/25MDF 440VAC | JJboy | HVAC | 20 | 10-10-2011 09:12 PM |
Dual stage or 2 furnaces? | bedmad` | HVAC | 6 | 02-09-2010 07:19 PM |
Twinned Furnaces Questions | MrControls | HVAC | 12 | 12-13-2008 10:09 AM |


text: Internal CIA documents [part 1, PDF; part 2, PDF; part 3, PDF] released last April reveal that the former head of the agency Porter Goss may have agreed to the destruction [JURIST report] of videotapes [JURIST news archive] showing harsh interrogations of terror suspects. According to redacted documents [text, PDF] filed in March 2009, 12 of 92 videotapes destroyed by the CIA [JURIST report] contained evidence of "enhanced interrogation techniques." The US Department of Justice (DOJ) [official website] had acknowledged in March 2009 that the CIA destroyed [letter, PDF] 92 videotapes of high value terrorism suspect interrogations, in response to an August 2008 judicial order [text, PDF] that the CIA turn over information regarding the tapes or provide specific justifications on why it could not release the information. The August 2008 order came in response to a December 2007 ACLU motion [text, PDF] that the CIA be held in contempt of court for not providing information on the tapes during a Freedom of Information Act (FOIA) [text] lawsuit [ACLU materials] brought by the organization in an effort to access government materials on the interrogations.


text:
Video: Video Gallery
Canine soldiers train for battle (0:34)
April 7 - North Korean state TV airs footage of the military running German shepherds through attack drills. Rough Cut (no reporter narration) ( Transcript )
Reuters TV Shows
About Reuters TV
Hard-edged reporting, insight and analysis, Reuters TV breaks ground creating informative news and financial videos. Showcasing Reuters' 3000 award-winning journalists, Reuters TV delivers high-energy investigative journalism with concise explanations. Check it out and let us know what you think.


text:
The story so far: Five weeks after he deployed to Afghanistan in July 2009, Brian Woods is shot by the Taliban.
Elizabeth Woods knew Brian had been shot in the head, but she didn't know how seriously he was hurt.
At some point during her frantic trip from Asheville, where she was on vacation, to her sister's home near Charlotte and on through the night to her house in Chesapeake, Va., in the midst of all the tears and rushing about, Elizabeth called the hospital in Germany.
She demanded to know the truth.
Brian's nurse spoke in broken English, and Elizabeth had trouble understanding him. But this much she heard clearly:
Your husband is brain dead.
Elizabeth dropped the phone.
He promised he wouldn't die! she screamed.
Her knees buckled. Her sister, Jennifer, lifted Elizabeth off the floor and into her arms.
When Brian hears my voice, Elizabeth told herself, he'll wake up.
Elizabeth nursed her daughter, Ella, who was 7 months old, for the last time. She told her she loved her. She kissed her goodbye. Then she handed Ella to her sister and boarded a plane in Norfolk for Washington, then the eight-hour flight to Germany.
Brian's sister, Catrina Kelemen, flew with her. And with them, Sgt. 1st Class Wright. He was a member of Brian's National Guard unit, assigned to stay in the States to handle administrative problems and be available for families if any of the soldiers were seriously injured.
From Frankfurt, they drove an hour and a half to Landstuhl hospital, where more than 10,000 Americans have been evacuated since the war on terror began in 2001. Some have returned to combat. Some were sent home for treatment. Others were brought to the hospital on life support, kept alive until their families could get there to say goodbye.
When Elizabeth and Catrina arrived, a surgeon and a chaplain were waiting.
Brian's condition, the surgeon said, was irreversible. They couldn't save him.
Elizabeth collapsed into a chair, sobbing. She had slept only a few hours over two days and hadn't eaten. She was lost to her emotions. Catrina had to help her get back up and lead her into Brian's room.
Last moments together
Elizabeth ran to the bed.
A towel around his head hid the bullet wound. The skin around his eyes was bruised and puffy, his lips cracked. There was dirt from the desert battlefield beneath his fingernails and on his eyelashes, and tubes all about. Otherwise he looked as peaceful as if he were asleep beside her at home.
Elizabeth kissed his face and stroked his arms and hands, weeping, hugging him, telling him she loved him. She asked if she could lie next to him. She wanted to wrap him in her arms. But a nurse said it wasn't safe. Brian could be carrying diseases from Afghanistan.
Elizabeth held onto his hand and filled their last hours together talking. Brian's eyes, which had been so full of passion for life, and for her, remained flat and expressionless. Elizabeth hoped that somewhere, deep inside, maybe he could hear her. Maybe.
'You made me stronger'
She talked about the afternoon they met 31/2 years earlier in Asheville, how they looked into each other's eyes and fell into each other's arms and married 11 months later. He once told her that the moment he saw her, he knew he was going to marry her.
Tears poured down her face as she thought about all they had done in their short time together, and all they would never do. They survived the death of their infant son, and now they had a beautiful new daughter who would never know her father.
Their lives were beginning to fall into place.
"You pushed me to become who I am," Elizabeth remembers saying. "You could see me better than I could see myself. You were my mirror. You woke me up. You made me stronger. You challenged me. Nothing to you was impossible."
Without you, she wondered, who am I?
William Brian Woods died on the afternoon of Aug. 16, 2009, the 785th U.S. service member to die in the war.
When the time came to turn off the life-support machines, Elizabeth gave permission to donate his organs. But not his heart. Brian gave his life for his country. She would not allow him to give any more.
His heart, she said, belongs to me.
I will never get over this
Within a few hours, a wounded soldier took Brian's bed in the hospital. Within a few days, a new soldier took his place on the battlefield.
Elizabeth felt as if she were a casualty, too, injured, beaten up, paralyzed.
Sgt. Wright escorted her back to Charlotte. Another Green Beret escorted Brian's body. In the tradition of the Special Forces, a soldier would stay with Brian every minute of every day and every night until he was buried. Even in death, the brotherhood endured.
At the funeral home in Huntersville, a stranger walked up to Elizabeth. She introduced herself as a member of the Gold Star Wives, women whose husbands were killed in the line of duty.
You will get through this, she said, and she smiled at Elizabeth. Elizabeth couldn't imagine smiling ever again.
This is what you're going to do, the woman told her. You're going to put one foot in front of the other and take one step forward at a time.
For the first time in the week since Brian died, Elizabeth felt as if there was someone who understood her pain.
But after the woman left, she turned to her two sisters. I will never get over this.
As he stood watch from a few feet away, Sgt. Wright worried that she never would.
A haunting anthem
At Brian's memorial service at Latta Plantation Park, a guitarist sang "The Ballad of the Green Berets." The song is the anthem of the Special Forces, one of Brian's favorites. Elizabeth hated it.
Fighting soldiers from the sky
Fearless men who jump and die
Men who mean just what they say
The brave men of the Green Beret.
How, she would ask Brian, can you sing about dying?
At the memorial service, the words cut hard. Elizabeth's Green Beret had met his fate.
Brian had told her that if he was killed, not to bury him in Arlington National Cemetery. He wanted to be buried in St. Louis next to their son.
Elizabeth did not follow his casket to Missouri, where the governor ordered flags flown at half-staff. More than 300 Patriot Guard Riders on motorcycles accompanied the funeral cortege, and hundreds of Americans lined the highway to bid farewell to a hometown hero.
Elizabeth stayed behind at her sister Jennifer's house in Marvin, south of Charlotte. She could go no farther.
Brian's fight was over. Hers had just begun. It was Elizabeth's war now.
Saturday: A letter from Brian.
Elizabeth Leland: 704-358-5074
Subscribe to The Charlotte Observer.
The Charlotte Observer welcomes your comments on news of the day. The more voices engaged in conversation, the better for us all, but do keep it civil. Please refrain from profanity, obscenity, spam, name-calling or attacking others for their views.
Have a news tip? You can send it to a local news editor; email firstname.lastname@example.com to send us your tip - or - consider joining the Public Insight Network and become a source for The Charlotte Observer.
Read more


text:
Washington, DC Monday, February 11, 2013
In November 2012, Colorado and Washington voters passed ballot initiatives making their states the first to legalize marijuana for non-medical purposes.
The RAND Corporation hosts a wide-ranging discussion on the public health effects of these new laws and lessons learned from alcohol and tobacco regulations.
On panel one, a former Colorado medical marijuana dispensary owner and health policy professors examined the licensing, production and distribution side of alcohol and tobacco, looking for guidance in formulating a public policy strategy for marijuana.
On panel two, health policy professors as well as economists and behavioral scientists talked about the restrictions on the use, sale and advertising of marijuana, alcohol and tobacco.
Updated: Monday, February 11, 2013 at 6:50pm (ET)
Related Events
Administration officials in charge of food safety testified before the House Appropriations Subcommittee on Agriculture, Rural Development, FDA and related agencies.
More Info »
American History TV visited Alexandria, Virginia and the National Inventors Hall of Fame and Museum - inside the U.S. Patent and Trademark Office - to tour an exhibit about health & fitness inventions. We'll learn about 19th century patent medicines, a mechanical horse used by President Calvin Coolidge, the origins of Gatorade & Nike, and the trademarks and patents of fitness guru Jack LaLanne.
Newark Mayor Corey Booker also takes part in a conference sponsored by Partnership for a Healthier America.
The National Press Club holds a news conference to discuss how the new healthcare laws are taking shape in the states during a Newsmakers' event titled "Obamacare on the Ground."
As part of the ongoing review by lawmakers into mental health issues raised by the Newtown shooting, the House Energy and Commerce Committee talked with leading health experts to explore issues related to severe mental illness and violence.
Secretaries Arne Duncan and Kathleen Sebelius visit an elementary school in suburban Washington, D.C., to discuss head start programs and student health clinics.
Jonathan Blum, the acting principal deputy administrator and director of the Center of Medicare at the Centers for Medicare and Medicaid Services, testifies before the Senate Finance Committee on a progress report on the modernization of Medicare and Medicaid.
To reduce the prevalence of school age bullying, teachers, school counselors, and other members of the education community gathered at Columbia University for a summit titled "Beyond Bullying."
Guests Charles Evans Jr. and Victor DeNoble discuss the documentary film that chronicles DeNoble's unexpected discovery of an ingredient in tobacco which, the data revealed, when coupled with nicotine makes cigarettes more addictive. The research and the company's attempts to keep it private lead to Congressional testimony before a subcommittee of the House Energy and Commerce Committee. The movie details how this public revelation of DeNoble's findings led journalists, politicians, attorneys and scientists to join forces against the tobacco industry, which ultimately resulted in the first ever federal regulation of the tobacco industry. Evans discusses how and why he went about making the film, which began when he first watched Dr. DeNoble's testimony on C-SPAN in 1994. DeNoble talks about growing up in New York, his early work at the Philip Morris Company and what it was like to testify before Congress on such a controversial subject.
Jefferson Keel, president of the National Congress of American Indians, delivers the 2013 State of Indian Nations Address at the National Conference of American Indians.
Video Playlist
Related Resources


text:
QuickTime to provide YouTube support
Apple Insider has unearthed proof that YouTube uploading will be built into the upcoming version of QuickTime that ships with OS X 10.6.
According to beta testers, several video-sharing options will be baked into the latest release of Apple's QuickTime media playback and editing software, including the capability to directly upload to YouTube. With the new QuickTime, you will be able to convert and upload any supported video file type to the online video service and all you will need is to be a registered YouTube user. You also will be able to seamlessly upload supported video to … Read more


text:
If you've ever been stuck rummaging through piles of papers, clothes, or that seemingly endless amount of ""miscellaneous"" items in your home in Greenville to find what you need in your closet, you know the frustrations of lack of closet organization.
Take these 3 tips from the queen of time-saving techniques, Martha Stewart, to utilize closet organizers in your Greenville house:
3 Closet Organizer Tips
- Label, Label, Label - When you can see at a glance the contents of a storage box within your closet organizer, you will save a lot of time not having to dig through all of them! But don't use sticky labels: they are not only messy, but they are hard to update. Instead, make tags by attaching unlined index cards to clothespins. This way, you can mark anything easily -- from plain shoeboxes to fancier bins. When it's time to relabel, just unclip the old card and fasten on a new one.
- Avoid Coat Pile-ups - Piles of coats — whether they be on hangers or on the floor — are the sign of a poor closet organizer system. And when you're running late, you need to be able to find the best coat that works with your wardrobe and the Greenville weather. Talk to your California Closets Greenville designer about your coat closet organizer needs and you'll never be rummaging through coat piles again.
- Smart Cleaning Storage - Many people store mops and brooms by standing them in a corner, but this can cause broom straw to bend and mop heads to mildew. Use a California Closets accessory to hang them with their "business ends" up. The dustpan should also be kept off the floor; hang it from the hole in its handle.
Why Wait? Use Closet Organizers to Conquer Clutter
Ready to get your closet organizers up and running? Call California Closets Greenville today to schedule a free in-home design consultation, or visit our showroom in downtown Greenville to see closet organizers in "real" Greenville homes.


text:
Hosted at youtube.com This video is provided and hosted from a 3rd party server. Our search functionality is helping you discover publicly available websites & their content. Footytube as a search engine does not host or upload this material and is not responsible for the content.
Community Opinion & Comments
How did the teams perform?
Share your thoughts
0 - 0
E. Escalante (7)
A. Jiménez (62)
A. Jiménez (62)
A. Bravo (31)
P. Burton (65)
J. Fernández (85)
P. Burton (65)
J. Fernández (85)


text:
By the time your child enters kindergarten, he/she should:
Play, read, learn, and listen using Alphabet Bites.
Alphabet books and videos available at your library.
Watch and listen to familiar fables in the Story Corner.
Stories, songs, games galore to get your learning juices going!
Learning to read? Rhyming to the rescue!
Play reading games with these plush toys.
Read a story with a loveable furry friend. Play with books featuring phonics fun for early readers.
Tips for families to help prepare their child to read.
Fun, interactive learn-to-read games for preschool through 1st grade.
Listen to stories, play games, and print worksheets for fun themes from firefighters to monkeys!


text: Welcome to Sky Express Cars & Couriers We are a fully licensed minicab company established since 1990 and have become the largest in West London, UK. Sky Express Cars & Couriers provide you with a courteous and reliable minicab service. Our Staff and drivers are fully trained and committed to providing you with your requirements and exceeding your expectations. Sky Express Cars are equipped with the latest computerised minicab booking and dispatch system to enable us to take your minicab bookings accurately and efficiently and to provide your car promptly. Call us if you need, minicab or courier services in Southall, Ealing, Middlesex, London and the M25 area. |


text:
Jay Gatsby would have loved the Palm Beach 55, because it embodies all that he lusted after in The Great Gatsby: class, style and grand luxury. In fact, I'm convinced that he would have forgotten all about Daisy Buchanan after one look at this boat.
The Palm Beach 55 is the latest incarnation of the downeast-style lobster-boat-turned-yacht. There have been a number of predecessors, including those actually built somewhere in the Northeast. There have been some Down (Far) East versions built in the Orient, some Down (Over) East yachts built in Italy and a stylish Down West line from the Pacific Northwest, but this is the first Down Under lobster-yacht. And, as the Aussies say on her home turf, "she's a right corker," meaning something better than excellent.
Company owner Mark Richards is arguably Australia's best-known sailor and an America's Cup veteran, so it's no accident that these yachts blend fine craftsmanship, thoughtful design and advanced construction materials and methods.
Our day on the water was the worst possible: 25 knots gusting to 35, and blowing against the Gulf Stream. On some yachts, it could have felt like driving a bulldozer over boulders: over one, crash, up the next, crash. But on the Palm Beach 55, it was more like riding a gently cantering horse. Green water arched to each side, yet there wasn't a creak or a groan.
The American representative for Palm Beach, Andy Shoemaker, made a comment that I found to be true as I poked around the interior: "She has a thread of simplicity." This is, in spite of some very clever ideas, a very simple yacht.
View a complete photo gallery here.
Take the Burmese-teak interior. Richards gets a container of teak, picks the best pieces and sends the rest back. Simple, but even the lockers match perfectly in grain and color. I would put the woodwork on the 55 up against that of the finest megayachts from Europe, and if anyone were going to wind up embarrassed, it wouldn't be the Aussies.
Newsletter Sign-up
Yachting Marketplace
Your Online Source For All Things Nautical
Shop Online Now! >Videos


text:
We need all services you need for a comfortable holiday in Apulia. Barocco Palace is a building of the 18... Plus d'info »
Half way between Lecce and its beautiful sea there is the B&B redrooms, very well connected by fast roads. A... Plus d'info »
An unforgettable stay in the heart of Lecce, the pearl of the Italian Baroque. Lovely rooms and delicious breakfast... Plus d'info »
The B&B Leccearte offers accommodation in a double bedroom + single sofa bed,air conditioning, TV, wireless... Plus d'info »
The Reale Bed & Breakfast is a century-old building that was renovated a few years ago. It has rooms with... Plus d'info »
In the heart of Salento, in the center of Lecce, 200 meters from Piazza Duomo, located at 63 University Avenue, there... Plus d'info »
The Apartment boasts a refined and relaxing, design rooms, overlooking the main street of walking Lecce, with free... Plus d'info »
Le Bed & Breakfast La Piazzetta est situé dans un 19ème siècle sur dell'Addolorata Piazzetta - l'une des plus belles... Plus d'info »
B & B 95e Régiment à Lecce offre l'hospitalité ... bienvenue .. simplicité .. . confidentialité. Installé dans un... Plus d'info »
Situated in the wonderful historic centre of Lecce, 300 mt central square, 'piazza Sant.Oronzo' and 'Duomo'.... Plus d'info »
Terrazza Sant \\\\ \\\'Irene a le plaisir de vous accueillir dans une structure ancienne entirement rnove en 2012.... Plus d'info »
Sacré Bleu is a small independent accommodation in the heart of the historical center of Lecce. It's spacious as a... Plus d'info »
Monastero B&B is located in the heart of Lecce's historic centre, 100 mt away from Duomo Square. It's an ancient... Plus d'info »
The bed and breakfast Arcu te Pratu is situated in the heart of the historic center of Lecce, just crossed a historic... Plus d'info »
The bed & breakfast \\\\\\\'Le Comari Salentine\\\\\\\' is a great way to spend a pleasant holiday in Lecce. Its... Plus d'info »
Immersed in the red land of Salento, among olive trees, Indian figs and fruit trees, situated in a privileged... Plus d'info »
At Lecce, a city of art and culture, right at the heart of the historical centre and opposite the monumental Santa... Plus d'info »
Luna Piena is located in Lecce (Salento, Puglia) near the historic centre. Its strategic location allows tourists to... Plus d'info »
Borgoterra is located in Martano, 25 km from Lecc Borgoterra is located in the old town of Martano in the heart of... Plus d'info »
Bed & Breakfast Sant Andrea is located in Piazza Regina Margherita in historical and social centre of Novoli (just 7... Plus d'info »