text:
VIEWS: 111 PAGES: 10 CATEGORY: Emerging Technologies POSTED ON: 8/13/2011 Public Domain
Journal of Computer Science and Information Security (IJCSIS ISSN 1947-5500) is an open access, international, peer-reviewed, scholarly journal with a focused aim of promoting and publishing original high quality research dealing with theoretical and scientific aspects in all disciplines of Computing and Information Security. The journal is published monthly, and articles are accepted for review on a continual basis. Papers that can provide both theoretical analysis, along with carefully designed computational experiments, are particularly welcome. IJCSIS editorial board consists of several internationally recognized experts and guest editors. Wide circulation is assured because libraries and individuals, worldwide, subscribe and reference to IJCSIS. The Journal has grown rapidly to its currently level of over 1,100 articles published and indexed; with distribution to librarians, universities, research centers, researchers in computing, and computer scientists. Other field coverage includes: security infrastructures, network security: Internet security, content protection, cryptography, steganography and formal methods in information security; multimedia systems, software, information systems, intelligent systems, web services, data mining, wireless communication, networking and technologies, innovation technology and management. (See monthly Call for Papers) Since 2009, IJCSIS is published using an open access publication model, meaning that all interested readers will be able to freely access the journal online without the need for a subscription. We wish to make IJCSIS a first-tier journal in Computer science field, with strong impact factor. On behalf of the Editorial Board and the IJCSIS members, we would like to express our gratitude to all authors and reviewers for their sustained support. The acceptance rate for this issue is 32%. I am confident that the readers of this journal will explore new avenues of research and academic excellence.
(IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 Design and Implementation of Internet Protocol Security Filtering Rules in a Network Environment Alese B.K. Gabriel A.J. Adetunmbi A.O. Department of Computer Science, Federal University of Technology, P.M.B. 704, Akure, (Nigeria) firstname.lastname@example.com firstname.lastname@example.com Abstract communications among government- sponsored researchers and grew steadily to Internet Protocol Security (IPSec) include educational institutions, devices are essential elements in government agencies, and commercial network security which provide traffic filtering, integrity, confidentiality and organizations. Having experienced a great authentication based on configured advance in the past decades, the Internet security policies. The complexities has today, become the world's largest involved in the handling of these policies computer network, doubling in size each can result in policy conflicts that may year. However, the Internet today, has cause serious security breaches and become a popular target to attack. The network vulnerabilities. This paper number of security breaches is in fact fast therefore presents a mathematical model developed for IPSec filtering rising than the growth of the Internet as a rules and policies using Boolean whole [9]. expressions. A comprehensive classification of security policy conflicts A lot of methods which include; that might potentially exist in a single access control techniques, password, IPSec device (intra-policy conflicts) or physical protection and between different network devices encryption/decryption methods, have been (inter-policy conflicts) in enterprise used to ensure the overall security of networks is also presented. All these are Computer Networks. However, as implemented in user-friendly interfaces researchers kept researching and devising that significantly simplify the various effective security measures, the management and/or proper cryptanalysts (cyber-criminals) on the configuration of IPSec policies written other hand, kept working out how these as filtering rules, while minimizing security measures could be broken, network vulnerability due to security bypassed, or penetrated. As a result, [1] policy mis-configurations. reported that despite all efforts, finding a Keywords: Anomalies, Conflicts, IPSec, concrete solution to network security problems has been a mirage. Policy, Protocols. How painful it is to know that most 1. Introduction cybercrimes which may include identity The emerging use of TCP/IP networking theft, child pornography, Spam, Fraud, has led to global system of interconnected Hacking, Denial of Service attacks, Computer Viruses, Intellectual property hosts and networks that is commonly theft and so on, take advantage of referred to as the Internet [9]. The internet loopholes created by IPSec security policy was created initially to help foster 134 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 related problems[1]. Therefore, the A packet is protected or discarded, as effectiveness of the IPSec technology with the case may be, by a specific rule if the respect to the security of Computer packet header information matches all the networks is dependent on (1) the thorough network fields of this rule. Otherwise, the understanding of the sources of these next following rule is used to test the conflicts, (2) providing policy matching with this packet again. Similarly, management techniques/tools that enable this process is repeated until a matching network administrators to analyze, purify rule is found. If no matching rule is found, and verify the correctness of written IPSec the assumption here is that traffic is rules/policies, with minimal human dropped /discarded. intervention 2.1 The basic Filtering Rule Format This paper, defines a formal model for IPSec rule relations and their filtering The most commonly used matching fields representation, and highlights the single- IPSec filtering rules are: protocol type, trigger as well as the multi-trigger source IP address, source port, destination semantics of IPSec policies. This paper IP address and destination port.[9] and [5]. also presents comprehensive classification Below is a common packet filtering rule of conflicts that could exist in a single format in an IPSec policy; IPSec gateway (intra-policy conflicts) or <order> <protocol> <src_ip> <src_port> <dst_ip> <dst_port> <action> between different IPSec gateways (inter- policy conflicts) in enterprise networks Where, with a view to enhancing the identification - order of a rule determines its of such conflicts. Finally, a brief position relative to other filtering description of the implementation is rules. presented. - protocol specifies the transport protocol of the packet, and can be one of these values: IP, ICMP, 2. Internet Protocol Security (IPSec) IGMP, TCP or UDP. Policy Background src_ip and dst_ip specify the IP addresses of the source and IPSec policy is a list of ordered filtering destination of the packet rules that define the actions performed on respectively. matching packets[9][10]. A rule is src_port and dst_port fields specify composed of filtering fields (also called the port address of the source and network fields) such as protocol type, destination of the packet source IP address, destination IP address, respectively. The port can be a source port and destination port, and a single specific port number or any filter action field. Each network field could port number, indicated by "any". be a single value or range of values. - action specifies the action to be Filtering actions are either of the taken when a packet matches a following; rule. - Protect: for secure transmission of packets in and/or out of the secured The protocol, src_ip, src_port, dst_ip, and network dst_port fields, can be referred to as - Bypass: for insecure transmission "network fields" or 5-tuple filter. - Discard: to drop the traffic (cause the packets to be discarded). 135 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 3. IPSec Policy Modelling As an illustration, the following security In order to successfully enhance the policy is to discard/block all UDP traffic effectiveness of any IPSec device, there is coming from the network 130.192.36.∗ need to first model the relations and except HTTP: representation of IPSec rules in the policy. 1: udp, 130.192.36.∗, any, ∗.∗.∗.∗, 80, protect Such a model should be complete and easy to implement and use. Rule relation 2: udp, 130.192.36.∗, any, ∗.∗.∗.∗, any, discard modelling is necessary for the analysis of IPSec policies and designing management techniques such as conflict detection and 2.2 Related Work rules editing. The rules or policy representation modelling is important for IPSec has been deployed for many years, implementing these management none of the related research works have techniques and visualizing the IPSec used formal methods to comprehensively policy structure. This section, describe identify IPSec policy conflicts and as well formally the proposed model of IPSec rule provide algorithms for the management relations and policies. (detection and resolution) of these conflicts. [11] is a related work that 3.1 Modelling IPSec Rule Relations proposed a simulation technique in detecting and reporting IPSec policy [3] asserted that, as rules are matched violations. The technique considered just sequentially, the inter-rule relation or one of the many forms of policy conflicts. dependency is critical for determining any [3] studied the policy conflicts particular to conflict in the security policy. In other firewalls that are limited to only "accept words, if the rules are disjoint (no inter- "and "deny" actions. [8] is a related work rule relation), then any rule ordering in the that used a Query based approach to security policy is valid. Therefore, analyze firewall policies. However, they classifying all types of possible relations all have limited usability, as they require between filtering rules is a first step to high user expertise to write the queries understanding the source of conflicts due needed to identify different policy to policy mis-configuration. Although [6] problems. Other work in this area did an extensive work on the rule relations addresses general management policies that could exist in IPSec policies, this rather than filtering policies. Although particular paper will go ahead to present a this work is very useful as a general single model that captures all these rule background, it cannot be directly used for relations. IPSec conflict discovery. Another work, worthy of recognition is that of [6]. The Definition 1: Rules Rulx and Ruly are authors used Boolean expression and exactly matched if and only if every field ordered binary Decision Diagrams for their in Rulx is equal to the corresponding field modelling and representation and analysis in Ruly. of policies. This however might not be very comprehensive to every user. There is Definition 2: Rules Rulx and Ruly are every need for a comprehensive conflict inclusively matched if they do not match analysis framework for IPSec policies and if and only if every field in Rulx is a using formal techniques. subset or equal to the corresponding Ruly. In this relation, Rulx is called the subset match while Ruly is called the superset match. 136 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 Definition 3: Rules Rulx and Ruly are Where; correlated if and only if at least one field in Rulx is a subset or partially intersects with - Rurelns denotes Rule relations the corresponding field in Ruly, and the - i, j ∈ {protocol, src_ip, src_port, rest of the fields are equal. This means that dst_ip, dst_port} and there is an intersection between the address - ⊳⊲ , ⊳/⊲ ∈ {⊂, ⊃, = }. space of the correlated rules, although - EXm = Exact match, neither one is the subset of the other. - INm = Inclusive match - COR = Correlation Definition 4: Rules Rulx and Ruly are - PAD = Partial disjoint partially disjoint if and only if there exist, - CAD= Complete disjoint at least one field in Rulx that is a subset or a superset or equal to the corresponding field in Ruly, and there exist at least one field in Rulx that is not a subset and not a 4. IPSec Policy Conflict Classification superset and not equal to the Using the rule relations mathematical corresponding field in Ruly. model presented above, the various types of conflicts (anomalies) that could exist in Definition 5: Rules Rulx and Ruly are IP networks are identified and/or classified completely disjoint if every field in Rulx is as in figure 4.1 not a subset and not a superset and not equal to the corresponding field in Ruly. 3.2 The proposed model for filtering rule relations From the definitions above, the following mathematical model is developed. This captures all the possible rule relations and/or dependencies that exist in an IPSec policy. Figure 4.1. A classification chart showing IP Security policy conflicts. (Adapted from Hamed et al., 2004) 4.1 Access-List Conflict Types As the name implies, access-list conflicts are are conflicts that could exist between access-list rules that are either within a sing IPSec device (intra-policy conflicts) or in different IPSec devices (inter-policy conflicts. 137 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 4.1.1 Intra-Policy Access-List Conflicts - Ruly exactly or inclusively matches Rulx (i) Intra-policy shadowing: A rule is shadowed - Rulx and Ruly have similar actions. i.e., Rulx(action) = Ruly(action). when a previous rule with a different action matches all the packets that match this rule, Redundancy is a critical conflict. Though a such that, the shadowed rule will never be redundant rule may not contribute in the activated or triggered. Typically, rule Ruly is packet filtering decision, it adds to the size shadowed by rule Rulx if of the filtering rule, and this increases the - Rulx precedes Ruly in the order search time as well as the space requirement of the packet filtering process. - Rulx is a superset match of Ruly - Rulx and Ruly have different(iii) Intra-policy correlation: Two rules are actions. i.e. Rulx(action) ≠ correlated if the first rule (based on the Ruly(action) ordering) matches some packets that match the second rule and the second rule matches some packets that match the first Shadowing is a critical error (conflict) in rule. In other words, a correlation conflict the policy, as a shadowed rule never takes between two rules exists if the two rules effect. This may result in a legitimate are, correlated and have different filtering (desired) traffic being discarded (blocked) actions. A correlation conflict exist and an illegitimate (undesired) one being between Rulx and Ruly if permitted. This conflict as a matter of - Rulx and Ruly are correlated serious importance should be corrected by - Rulx (action) ≠ Ruly(action) the network administrator. This can be achieved by reordering the rules such that, A correlation conflict exists between Rul7 once there is an inclusive or exact match and Rul8 above. These two rules imply that relationship between two rules, any all traffic coming from 126.96.36.199 and superset (general) rule should come after going to 126.96.36.199 is protected. If the subset (specific) rule. Alternatively, the however, the order is reversed, the same shadowed rule should be removed from the traffic is discarded (blocked). policy, if this leaves the policy semantics Correlation is considered a potential unchanged. conflict (warning). The user (or network administrator) should look into the (ii) Intra-policy Redundancy: A rule is correlations between the filtering rules and redundant, if it performs the same action decide the proper ordering that complies on the same packets as another rule such with the security policy requirements as that, if the redundant rule is removed, the otherwise, unexpected action might be security policy will not be affected. (i.e., performed on the traffic that matches the remains unchanged). In other words, a rule intersection of the correlated rules. is redundant if all packets that could match it are matched by some other rule that has a similar action. Formally, rule Ruly is (iv) Intra-policy exception: A rule is an redundant to rule Rulx if the following exception of another rule, if the following holds; rule is a superset match of the preceding rule. That is the rule can match all the - Rulx preceeds Ruly in the policy packets that the preceding rule could match. order 138 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 In other words, Rulx is said to be an instance is a situation where an upstream exception of Ruly if; IPSec device discards (blocks) traffic that - Rulx precedes Ruly in the order is permitted by its downstream - Rulx is a subset match of Ruly counterpart, or vice-versa, causing the - Rulx(action) ≠ Ruly(action) traffic to be dropped (hence, not reaching its destination) at the upstream device or It is worthy of note here that, if Rulx is an the downstream device respectively. exception of Ruly, then, Ruly is a generalization of Rulx. (i) Inter-policy shadowing: this is similar to intra-policy shadowing except Exception is desired most times, to for the fact that, it occurs between rules in exclude a specific part of the traffic from a two different IPSec devices. general filtering action. As a result, exception is not a critical conflict. Inter policy shadowing conflict therefore Nevertheless, it is important, to identify refers to a scenario where, an upstream exceptions because, exception rules change the policy semantics, and this policy, ApolU, block or discard some might cause desired traffic to be blocked, traffic that is permitted by the downstream or, undesired traffic to be policy ApolD. Formally, we say, inter- accepted/permitted. policy shadowing conflict occurs if Irrelevance: A filtering rule in an IPSec In a situation where the conflicting rules policy is irrelevant if this rule cannot are exactly matched, we have complete match any traffic that might flow through shadowing conflict, if however, they are this IPSec device. This exists when both inclusively matched, we have partial the source address and the destination shadowing. In any case, shadowing is a address fields of the rule do not match any critical conflict, since it prevents the traffic domain reachable through this device. In desired by some nodes from flowing to the other words, the path between the source end destination. and destination addresses of this rule does not pass through the IPSec device. Thus, this rule has no effect on the filtering outcome of this device. Formally, rule Rulx (ii) Inter-policy spuriousness: inter- in a device DEV is irrelevant if: policy spuriousness is said to have occurred in a situation where, the upstream DEV {n : n is a node on a path from Rulx [src] to policy ApolU permits traffic blocked by the Rulx [dst] } downstream policy ApolD.. Irrelevance is considered an anomaly because it adds unnecessary overhead to 4.2 Map-List Conflict Types. the filtering process and it does not The map-list, which is the part of the contribute to the policy semantics. policy that specifies the security requirements of each traffic, is also worthy 4.1.2 Inter-Policy Access-List Conflicts of mention here. The rule conflicts that may exist in the crypto-map list of a single Conflicts could also occur between IPSec device (intra-policy) may exist policies of different IPSec devices. An between the crypto-map list of different 139 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 IPSec devices (i.e., inter-policy) are there presented in this section. These conflicts may result in security policy violation (i.e., 5.1 Hardware and Software insecure transmission of traffic) redundant Requirements or unnecessary traffic protection. The implementation of the system was 4.2.1 Overlapping session conflicts carried out on an Intel(R) core(TM) 2 duo Tunnel overlapping conflict occurs processor computer system, via the use of because the rules were not ordered the following software packages; correctly in the map-list such that the priorities of IPSec sessions terminating at NetBeans Java Development further points from the source are higher Environment (JDE) than the priorities of the ones with closer Java Runtime Environment (JRE) termination points. In general, by looking MySQL database management at any IPSec policy, this conflict exists if system two rules match a common flow, and the tunnel endpoint of the firstly applied rule While MySQL database management comes before the tunnel endpoint of the system, served as the back-end, NetBeans following rule in the path from source to Java Development Environment was used destination. Notice that this conflict can for the front-end purpose. only occur with two tunnelled transforms The computer system on which the or with a transport transform followed by a implementation was done has a processor tunnel. speed of 2.00GHz, a 2.00GB RAM as well 4.2.2 Multi-transform conflicts as a 256GB hard disk capacity. Peripherals The multi-transform conflict occurs when such as mouse and a printer were also two rules match a common flow, and the used. secondly applied rule uses a weaker transform on top of a stronger one applied by the other rule. For flexibility, the strength of any transform can be user- 5.2 System Development defined such that if a transformation has a larger strength value, then it provides The developed system has the following better protection, and vice versa. interfaces; - The Rules Editor interface - The IPSec gateway interface 5. Implementation and Documentation - The Host System interface Using MySQL database management system, as the back-end, NetBeans and Java Development Environment (JDE), a number of user-friendly interfaces were designed. These interfaces can be used by network administrators as an aid in the proper general management and/or handling of security policies in a manner that avoids conflicts, hence, security breaches. 140 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 introduce a conflict, but it might change the semantics of the policy, and this is worthy of note. To remove a rule, the user enters the rule order number, the source and destination ip addresses in order to retrieve the rule from the rule list, and then, clicks the remove button to remove the selected rule. (c) Rule modification Rule modification can be achieved almost the same way as rule removal, except that in modification, the "Edit" button is Figure 4.1 The Rules editor interface clicked instead. Modification is also a critical operation, and should be done with At the rule editor interface, the following utmost carefulness. can be accomplished. - New rule insertion - Rule editing/modification - Rule removal (a) Rule Insertion This interface can be used by the administrator to insert (or add) a new rule to the existing ones in a policy. The ordering of rules in the filtering rule list directly impacts the semantics of the IPSec policy. The administrator must therefore be careful to add/insert a new rule in the Figure 4.2 Rule Editor interface showing the proper order in the policy such that, no available action types conflict (e.g., shadowing, correlation, or redundancy) is introduced. To add a new The IPSec_gateway Interface rule, the user, enters the order, protocol type, source ip, source port, destination ip On this interface, the network address, destination port number, and then administrator can view the various selects both the action type and the conflicts between rules in the security particular gateway where the rule will policy at a particular gateway. The various function. After these are done correctly, analyses that lead to the discovery of each the user clicks the insert button to add the of the conflicts are hidden from the user. rule. Once the user (network administrator) clicks the "intra Policy" button, the intra- (b) Rule Removal policy conflicts on that particular gateway are displayed. This gives room for In general, removing a rule has much less necessary actions to be taken by him. If the impact on the IPSec policy than rule "inter policy" is clicked however, then, the insertion. A removed rule does not inter-policy conflicts as well as their 141 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 effects are shown clearly. Below is the IPSec gateway interface. Figure 4.6 The IPSec Gateway interface Figure 4.4 The IPSec gateway interface showing inter-policy conflicts and their effects. Once the user (network administrator) clicks the "intra Policy" button, the intra- 5.3 Conclusion and Recommendation policy conflicts on that particular gateway are displayed. In this paper, all possible IPSec rule relations were highlighted. From these, a single model that captures all these relations was presented. Based on these, a comprehensive classification of IPSec policy conflicts (anomalies) that could exist in enterprise network was also presented. A comprehensive classification of the conflicts in filtering-based network security policies was presented. These conflicts include improper traffic flow control, like shadowing and spuriousness conflicts, as well as incorrect traffic protection, like conflicts between nested/overlapping security sessions. Easy-to-follow guidelines to identify and rectify these conflicts were also presented. Based on these, a number of user-friendly Figure 4.5 The IPSec gateway interface interfaces were designed. These interfaces showing intra-policy can be used by network administrators as anomalies/conflicts between an aid in the proper general management some sample rules. and/or handling of security policies in a manner that avoids conflicts, hence, security breaches. The geometric increase in the number of users of computer networks for various important purposes, as well as the growing importance attached to the security of such 142 http://sites.google.com/site/ijcsis/ ISSN 1947-5500 (IJCSIS) International Journal of Computer Science and Information Security, Vol. 9, No. 7, July 2011 networks, mean that researchers must not [6] Hamed, H. Al-shaer, E. And "rest on their oars" in the bid to finding Marrero, W. "Modelling and solutions to the many network attack Verification of IPSec and VPN threats facing our world today. Little, Security Policies". Proceedings of seemingly unimportant issues (like, the 13th IEEE International configuration of security policies) must Conference on Network Protocols also be noted, as such could render even (ICNP'05) 2005 the best of network security device ineffective, and/or of no use. [7] Hari, B., Suri, S., and Parulkar, G., "Detecting and resolving packet filter conflicts". In IEEE References INFOCOM'00. 2000 [1] Alese, B.K. "Design of [8] Hazelhurst, S. Attar, A. and Public Cryptosystem using Eliptic Sinnappan, R. "Algorithms for Curve," Ph.D Thesis, Federal improving the dependability of University of Technology, Akure, firewall and filter rule lists". In Nigeria. 2004. IEEE Workshop on Dependability [2] Al-Shaer, E. and Hamed, H. of IP Applications, Platforms and "Design and Implementation of Networks. 2000 Firewall Policy Advisor Tools". [9] Oppliger, R. "Security School of Computer Science, Technologies for the World Wide Telecommunications and Web". Second Edition, Norwood, Information Systems, DePaul MA: Artech House Computer University, Chicago. 2002. Security Library. 2002 [3] Al-Shaer, E. and Hamed, H. [10] Spenneberg, R. (2003), "IPSec "Modeling and management of HowTo". Retrieved from, firewall policies". IEEE http://www.ipsec-howto.org. on eTransactions on Network and 25/02/2010, at 12:45pm, pp. 4-8. Service Management (eTNSM), 1(1). 2004 [11] Zhi, F. Wu, F. Huang, H. Loh, K. Gong, F. Baldine, I. and Xu, C. [4] Doraswamy, N. and Harkins, D. (2001) IPSec/VPN security policy: "IPSec: The New Security Correctness, conflict detection and Standard for the Internet, resolution. In Policy'2001 Intranets, and Virtual Private Workshop Network"s. Prentice Hall PTR, second edition. 2003 [5] Frankel, S. Karen, K. Ryan, L. Angela, O. Ronald, R. Stephen, S. "Guide to IPsec VPNs". Computer Security Division Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930, 2005 143 http://sites.google.com/site/ijcsis/ ISSN 1947-5500
Pages to are hidden for
"Design and Implementation of Internet Protocol Security Filtering Rules in a Network Environment"Please download to view full document


text:
USDA to Provide Additional Support to Food Banks, Soup Kitchens, and Food Pantries Across the Country
News Source : USDA to Provide Additional Support to Food Banks, Soup Kitchens, and Food Pantries Across the Country
Copy this html code to your website/blog to embed this press release.
More User Press Releases
More USDA Press Release...
- Forest Service Chief Predicts "Above Normal" Wildland Fire Potential in Much of the West
- USDA Announces Grants to Enable More Farmers Markets to Serve Low-Income Families
- USDA Announces $235 Million Available for Innovative New Conservation Partnerships
- Secretary Vilsack Kicks off USDA Farmers Market for 20th Season
- Agriculture Secretary Vilsack Travels to Turkey for G20 Agriculture Ministers Meeting
- Photo Hobbyist Wins "Share the Experience" 2014 Photo Contest
- Agriculture Secretary Vilsack Announces New Private Funds to Make Investments in Rural America
- U.S., Honduras Sign Agreement to Promote Agricultural Development and Trade
- Obama Administration Announces Eight Additional Promise Zones to Build Community Prosperity
- Secretary Vilsack Announces Rural Schools Payments
This press release is licensed under a Creative Commons Attribution 3.0 Unported License. Read full copyright information here.

subset: commoncrawl


text: How to Drink All Day and Not Pass Out 3 Brent Rose and 151 othersEditDelete Invite manuallyPromoteXDismissXUndismissBlock for gizmodoHide Look, drinking all day is not healthy. But what if you and the missus signed up for a nine-hour Napa County wine tour, and you want to get your money's worth? Or maybe you're hitting your bachelor pal's BBQ, and the action starts at noon. Or, maybe, what the hell, you just want to go all out on a hot summer day. This… » 6/29/12 5:00pm 6/29/12 5:00pm


text:
Guess where I'm eating smokin' hot barbecue"?
Lori Midson
Every time I drive down a certain stretch of asphalt, I pass by a dusty parking lot with a dilapidated truck and a huge smoker that emits the scent of barbecue. Over the weekend, my curiosity got the best of me, and I stopped to get a closer whiff -- and a closer look. And when I saw the meats in that smoker, I went all out, ordering ribs, pulled pork and Polish sausage, all of which were yanked from the flames by a charming pit master who turns out some of the best 'que I've had in Colorado.
Can you guess where I'm eating?
Special bonus: Anyone who gives the first correct answer to a Guess Where post -- on the Cafe Society blog, not on Facebook -- is entered into the contest pool, and every Monday, we select one lucky winner who'll receive a 2014 EatDenver dining deck, worth up to $520 in discounts at independent restaurants
Get the Dining Newsletter
The week's top local food news and events, plus interviews with chefs and restaurant owners, dining tips, and a peek at our print review.
Sponsor Content


text:
Exeter Express and Echo has all the Book Shops in Exeter listed, many with reviews and star ratings; select one of the local Book Shops from the list below for study books, latest releases, top ten books, fiction, travel and self-help books - be sure to return to Exeter Express and Echo and leave a review.
Why not list your Exeter Book Shop on Exeter Express and Echo?
Address: 18 Parade, , EXMOUTH, EX8 1RW
Address: 38 High Street, , SIDMOUTH, EX10 8EJ
Address: Royal Devon & Exeter Hospital, Barrack Road, EXETER, EX2 5DW
Address: 4 Silver Street, , OTTERY ST MARY, EX11 1DE
Address: 15 Paris Street, , Exeter, EX1 2JB
Address: 63 High Street, , Sidmouth, EX10 8LE
Address: 48-49 High Street, , EXETER, EX4 3DJ
Address: 7 West Street, , EXETER, EX1 1BB
Address: 12a Guildhall Shopping Centre, , EXETER, EX4 3HG
Address: The Market Place, , EXETER, EX4 4SZ
Address: 35 Church Road, St Thomas, EXETER, EX2 9AZ
Address: 3 Okehampton Street, , EXETER, EX4 1DW
Address: Legion Way , , Exeter, EX2 8TF
Address: 25 Guildhall Shopping Centre, 20 Waterbeer Street, EXETER, EX4 3HW
Address: 98 South Street, , EXETER, EX1 1EN
Address: 133 Fore Street, , EXETER, EX4 3AN
Address: 69 Chantry Meadow, , EXETER, EX2 8FU
Address: 11 Fore Street, , WELLINGTON, TA21 8AA
Address: 18 Fore Street, , SIDMOUTH, EX10 8DX
Address: 39 East Budleigh Road, , BUDLEIGH SALTERTON, EX9 6EW


text:
How they do it? How much server space they have? how they cover the costs if is free?
or more sinister (or noble, depending how you look at):
They just want everyone photos to be saved after the C/2012 S1 will hit earth as late as 2014? Maybe for future survivors? Or aliens who may visit a future lifeless earth?
( love this conspiracy theories )
So any idea?
1 terabyte! That's really huge and unbelievable.
I'm pretty sure that the thousands of premium members helps out a bit (only assuming here)
Maybe they have a technology to save data on atom.
Seems like Flickr are trying to grab attention of more users and increase the user base as big as possible. Also they are leaving out Pro tier and replace by the Ad-free and doublr tier. With this Ad-free tier, maybe Yahoo would try to put up more ads than ever so it's worth paying to get ad-free. The doublr tier is $500 a year doesn't really make sense to me because it's easy and free to get another terabyte – just register another account.
Give free services first, monetize after. (when you figure out ways)
That is the trend now. The same is happening with Tumbrl, service just bought by Yahoo for $1.1 billions.
Also, Flickr needs to fight 500px, which is super popular.
because anybody uses it anymore, it's annoying and unusable
That's it. I'm encrypting all my data into encoded jpgs. Unlimited cloud storage, here I come
On a more serious note: I think they're just assuming people will never even get close to such a figure. As long as they have enough space available to compensate for the few that do, they can just spread out the capacity. Curious as to how they're making enough money at this point, though. I mean, storage is cheap, but not that cheap, and especially bandwidth is a pain.
Just about a week or so there was a fact that on Youtube are uploaded 100hours of video every minute. Now those are really crazy.
Helpful Information
- Please read our community guidelines. Self promotion and discussion of piracy is not allowed.
- Open a support ticket if you would like specific help with your account, deposits or purchases.
- Item Support by authors is optional and may vary. Please see the Support tab on each item page.
Most of all, enjoy your time here. Thank you for being a valued Envato community member.


text:
Sign Up ForFREE Pattern Info!
Tell A Friend!
Out of Stock
With Our "Find This For Me" Service we notify you via email once we have stock!
Piece Code: SAGR
Piece Name: Sauce/Gravy Boat
© 2015 Replacements, Ltd. All rights reserved
Piece Code: WIS
Piece Name: Wine Sleeve
Size: 8 3/4 in
Special Characteristics:


text:
1,000 - 5,000 downloadsAdd this app to your lists
Tweets por @Appszoom
+ By bronczesko
This application is great entertainment for young and adult persons. You will hear in it excellent killingspree sounds. It's wonderful play for boring, grey, cold evenings. Certainly ull like it. Wish u great fun - peace!!
Comments and ratings for Headshot
- There aren't any comments yet, be the first to comment!


text:
Recursive partitioning
Recursive partitioning is a statistical method for multivariable analysis.[1] Recursive partitioning creates a decision tree that strives to correctly classify members of the population based on several dichotomous independent variables.
This article focuses on recursive partitioning for medical diagnostic tests, but the technique has far wider applications. See decision tree.
As compared to regression analysis, which creates a formula that health care providers can use to calculate the probability that a patient has a disease, recursive partition creates a rule such as 'If a patient has finding x, y, or z they probably have disease q'.
A variation is 'Cox linear recursive partitioning'.[2]
Advantages and disadvantages[edit]
Compared to other multivariable methods, recursive partitioning has advantages and disadvantages.
- Advantages are:
- Generates clinically more intuitive models that do not require the user to perform calculations.[3]
- Allows varying prioritizing of misclassifications in order to create a decision rule that has more sensitivity or specificity.[2]
- May be more accurate.[4]
- Disadvantages are:
- Does not work well for continuous variables[5]
- May overfit data.
Examples are available of using recursive partitioning in research of diagnostic tests.[6][7][8][9][10][11] Goldman used recursive partitioning to prioritize sensitivity in the diagnosis of myocardial infarction among patients with chest pain in the emergency room.[11]
- ^ Breiman, Leo (1984). Classification and Regression Trees. Boca Raton: Chapman & Hall/CRC. ISBN 0-412-04841-8.
- ^ a b Cook EF, Goldman L (1984). "Empiric comparison of multivariate analytic techniques: advantages and disadvantages of recursive partitioning analysis". Journal of chronic diseases 37 (9-10): 721–31. doi:10.1016/0021-9681(84)90041-9. PMID 6501544.
- ^ James KE, White RF, Kraemer HC (2005). "Repeated split sample validation to assess logistic regression and recursive partitioning: an application to the prediction of cognitive impairment". Statistics in medicine 24 (19): 3019–35. doi:10.1002/sim.2154. PMID 16149128.
- ^ Kattan MW, Hess KR, Beck JR (1998). "Experiments to determine whether recursive partitioning (CART) or an artificial neural network overcomes theoretical limitations of Cox proportional hazards regression". Comput. Biomed. Res. 31 (5): 363–73. doi:10.1006/cbmr.1998.1488. PMID 9790741.
- ^ Lee JW, Um SH, Lee JB, Mun J, Cho H (2006). "Scoring and staging systems using cox linear regression modeling and recursive partitioning". Methods of information in medicine 45 (1): 37–43. PMID 16482368.
- ^ Fonarow GC, Adams KF, Abraham WT, Yancy CW, Boscardin WJ (2005). "Risk stratification for in-hospital mortality in acutely decompensated heart failure: classification and regression tree analysis". JAMA 293 (5): 572–80. doi:10.1001/jama.293.5.572. PMID 15687312.
- ^ Stiell IG, Wells GA, Vandemheen KL et al. (2001). "The Canadian C-spine rule for radiography in alert and stable trauma patients". JAMA 286 (15): 1841–8. doi:10.1001/jama.286.15.1841. PMID 11597285.
- ^ Haydel MJ, Preston CA, Mills TJ, Luber S, Blaudeau E, DeBlieux PM (2000). "Indications for computed tomography in patients with minor head injury". N. Engl. J. Med. 343 (2): 100–5. doi:10.1056/NEJM200007133430204. PMID 10891517.
- ^ Edworthy SM, Zatarain E, McShane DJ, Bloch DA (1988). "Analysis of the 1982 ARA lupus criteria data set by recursive partitioning methodology: new insights into the relative merit of individual criteria". J. Rheumatol. 15 (10): 1493–8. PMID 3060613.
- ^ Stiell IG, Greenberg GH, Wells GA et al. (1996). "Prospective validation of a decision rule for the use of radiography in acute knee injuries". JAMA 275 (8): 611–5. doi:10.1001/jama.275.8.611. PMID 8594242.
- ^ a b Goldman L, Weinberg M, Weisberg M et al. (1982). "A computer-derived protocol to aid in the diagnosis of emergency room patients with acute chest pain". N. Engl. J. Med. 307 (10): 588–96. doi:10.1056/NEJM198209023071004. PMID 7110205.
|This medical article is a stub. You can help Wikipedia by expanding it.


text:
High Thrust Prop for Tohatsu 9.9 on Nonsuch 22
View Single Post
Hinterhoeller HR28
Join Date: Nov 2007
Location: Hamburg and Wilson NY
Posts: 156
Thanks: 9
Thanked 0 Times in 0 Posts
Rep Power:
Re: High Thrust Prop for Tohatsu 9.9 on Nonsuch 22
You are 100% 0n the right track!
The special 4-blade HT props for both the 8/9.8 and the 9.9/15 are fantastic for sail applications. They have 2 major characteristics that make them the best choice: 1. Huge blade area, combined with low pitch make them "shovel" water at low speeds. Also, 2: The over-sized hub allows the exhaust to stay off the blades when in Reverse, so the motor "bites" into clean water, giving Stellar reverse control. We install a lot of them, and have had Zero complaints -- all compliments! For your boat and motor combination, I would recommend the Tohatsu/Nissan 3Z0B645143, PROPELLER (7) 4 BLADE X 10 X 7 (F15/20C), which has an MSRP of $122.58, available from any Tohatsu/Nissan dealer (including me). FWIW, I personally have one of these type props, in 5-pitch, on the 9.8 on my 7,000-pound HR-28, and it out-performs the old 15 hp OMC motor that had a 3-blade prop. You can drop me an email at the office
email@example.com, or call 716-877-8221 M-F 9-5, and we can discuss the situation.
Paul Van Voorhees
Certified Tohatsu TLDI Technician
Mgr, Obersheimer Sails
Buffalo, NY USA
Last edited by pvanv1; 03-04-2013 at
. Reason: sp
View Public Profile
Send a private message to pvanv1
Find all posts by pvanv1


text:
Confront Terrifying Secrets in a Haunted Japanese Inn!
Traditional Japanese family ryokans (inns) are charming places, but a vengeful ghost is terrifying you and other unsuspecting guests. Is there a shadowy specter haunting the placid inn or is something far more sinister driving away business?
Meet Yumi Shimizu, the eldest girl in the family who has gone to the city to start a more modern life, as she blogs her way through fashion, food, and cuteness.
Key Features
Minimum System Requirements:


text:
News Roundup for July 14, 2011
- Yesterday Mercury Nashville and BMI honored Easton Corbin for being the first solo male country artist in 17 years to have his first two singles reach number one at radio.
- Peter Cooper's newest column is all about Bill Anderson.
- Check out "So Long Honeybee, Goodbye" from Pokey LaFarge & The South City Three's new record, due out next Tuesday.
- On October 18 Shout! Factory will release T Bone Burnett Presents: The Speaking Clock Revue, a benefit album showcasing 11 performances from a concert that Burnett orchestrated last year. Proceeds go to The Participant Foundation to support the inclusion of music and arts education in public school. The lineup of contributing artists—dubbed The Speaking Clock Revue—includes Elton John, Elvis Costello, Leon Russell, Gregg Allman, Ralph Stanley, Jeff Bridges, Neko Case, Jim James, Punch Brothers, and The Secret Sisters.
- Little Big Town covered Jessie J's "Price Tag (featuring B.o.B)" as the newest of their series "Scattered, Smothered & Covered".
- Kid Rock guests on For True, the upcoming album from Trombone Shorty, out September 13.
- On July 22nd the Sustainable Biodiesel Alliance is teaming up with the Amazon Watch for a fundraiser. The guest of honor is 2011 Visionary Award winner Willie Nelson.
- Trailer made some snap judgments over at Farce the Music.
- Faith Phillips interviewed Lukas Nelson, son of Willie.
- Here's a video premiere from The Devil Makes Three.
- Portland roots band Jackstraw is slated to release Six this fall. In celebration, they're planning six tours around the country.
13 Comments
On the shark jumping: Especially memorable is the always helpful Ms. Bonaguro's comment that she can't think of what else country songwriters might write about. Fortunately, they will not be waiting for her to come up with something.
I think the phrase "Jumping The Shark" has "Jumped The Shark".
The shark jumping was one of the best pieces I've read in a long time. Can it be – are people starting to see the light? Sadly, it's doubtful. Ah well, one can hope.
Easton Corbin is the new George Strait! Now all we need is a new Alan Jackson…
The entire AirHead Country modern music scene jumped the shark years ago. Unfortunately the Top 40 corporate program director types are proud of what they've accomplished and want to do it even moreso! Quality, "real" country music on AirHead Country radio is about as rare as hen's teeth these days.
I've developed an allergy to songs with "Honeybee" in the title. Too bad Pokey.
Just out of curiousity since I'm a chart trivia geek… who was that solo male artist to have his first two singles hit #1 17 years ago? I'm thinking Clay Walker. Didn't Darius Rucker do the same thing a couple of years ago though? Maybe it doesn't "count" since he has a history on the pop charts.
Wikipedia says that although "What's It to You" and "Live Until I Die" were both released in 1993, the latter didn't hit #1 until late January of 1994. So that explains where they're getting the 17.
Easton Corbin is no replacement for George Strait yet. He's got more work to do. Then again, our Retro Single Reviews at CU remind me that Strait didn't exactly knock it out of the park with his debut album/first few singles either.
I'm A Little More Late Than That…Oh the comedy with that title. Could even write a parody of "I'm A Little More Country Than That" and get all trailer park redneck-y with it (if somebody hasn't written it yet).
Easton Corbin is the new George Strait! Now all we need is a new Alan Jackson…
Rick, I draw your attention to Craig Campbell.
What I want to know is, what's wrong with the old Alan Jackson and the old George Strait? I'm not writing them off just yet! Especially not with that new song Strait just came out with.
It's a bit like when Springsteen was being hailed as the new Dylan (Bob, obviously, not me). Thirty-odd years later, the old one is still doing pretty good.
Current Discussion
- Paige: Oh damn. :( I never commented here and I haven't been listening to any music at all since Thanksgiving (it …
- Dave W.: Just read the news here. Will miss E145 very much - love this site. All the best to you Juli …
- Leeann Ward: Oh, dang! This is real. Farewell to the most generous, informative, quality, intelligent, consistent, ethical country music blog! You …
- bll: Thanks Juli for all the great articles and information; you'll be missed by me and I suss several others. Best …
- Both Kinds of Music: I hope people appreciate the irony that one of the best "Americana" albums is titled Metamodern Sounds in COUNTRY Music.
- Barry Mazor: I would not rule out that possibility..There's a different set of voters involved..
- Dana M: Does anyone else think that Brandy Clark actually has a good chance of winning since this isn't a country awards …
- Juli Thanki: UPDATE: Brandy Clark got a Best New Artist nom. BEST AMERICANA ALBUM: Rosanne Cash -- The River & The Thread John Hiatt -- Terms …
- luckyoldsun: Glenn Campbell is great and I'd love to see him get an award, but the words of that song may …
- Casey Penn: Juli, it was an honor to write for you here on Engine145.com. You're good at what you do, and The …


text:
Is Rihanna Dropping a New Single or New Album? [PHOTO]
Rihanna has the Twitterverse buzzing over what looks to be a new single (or possibly an album) dropping on Thursday (March 26).
Rihanna has the Twitterverse buzzing over what looks to be a new single (or possibly an album) dropping on Thursday (March 26).
Is there dissension in the Maybach Music Group camp? On Tuesday (July 8), Meek Mill jumped on Twitter and aired out labelmate Wale for apparently not supporting his upcoming album, 'Dreams Worth More Than Money.'
Mike Posner went from making his own platinum hits and super stardom to go behind the scenes and pen chart-topping songs for people like Justin Bieber. Now he's stepping back into the limelight with his new album 'Pages.'
The Flint Community Schools put on their annual Anti-Bullying showcase and this years show featured a record number of students participating.
There is hope for our youth in Genesee County after hearing that Grand Blanc High School Freshman class voted two special education students to the homecoming court.
Students from the Flint Community Schools participated in the Anti-Bullying Creative Arts Showcase Thursday night, as our community works to end bullying.
Its all about the voice.
We're about to insist that Tom Hanks stop being so awesome. It's getting out of hand. From hilarious pictures with strangers to amazing storytelling, he's getting to be too much. And now this. Hanks went
On the strength of playing breakfast meat connoisseur Ron Swanson on 'Parks And Recreation,' we think it's safe to call Nick Offerman a bacon expert.
However, we weren't aware of the depth of his dedication to the cured meat until we saw this video from CollegeHumor. In it, the mustachioed 42-year-old uses slam poetry to pay tribute to the internet's favorite food.
Kreayshawn is a white, female rapper. Those distinctions certainly make people curious about the tattooed and doe-eyed 'Gucci, Gucci' 22-year-old from Oakland, Calif.
Veteran rhyme-slinger Snoop Dogg says that hip-hop is ready for an openly gay rapper. In an interview with the Associated Press (via HipHopDX), the West Coast native feels that fans are becoming more receptive to people's differences.


text:
See also general information on Proficiency and Placement Exams.
Proficiency Exams measure your ability in a language and are used to satisfy or waive language requirements.
Placement Inerviews determine which language class is appropriate for your background and ability, and are only nescassary if you intend to take the course. The interview results cannont be substituted for a proficiency exam.
The department does not offer either Proficiency or Placement to those outside the University.
Please read carefully and thoroughly!
(For more information on Chinese language courses and answers to frequently asked questions, see the Chinese Language Courses page.)
Note: We do not offer the Exam to prospective UW students or non-UW students.
One way to waive the one-year UW foreign language requirement is to pass the Department's Mandarin Proficiency Exam, scheduled quarterly during the regular academic year, except for summer quarter. (For information on proficiency testing in non-Mandarin dialects of Chinese, please contact the Language Learning Center at 543-0536.)
Steps to take the Chinese Proficiency Exam:
- A $20 fee is to be paid on the day the Exam is taken. If paying by check, make it out to "Department of Asian Languages and Literature."
- Send an email to firstname.lastname@example.com with your (1) name, (2) student ID #, (3) e-mail address.
The next Proficiency Exam will take place: TBD (likely in August/September 2015)
Second- and third-year proficiency exams are also offered for CISB students and Jackson School students, generally held at the same time as the Mandarin Proficiency Exam described above. For details or to sign up for an exam, send an email to email@example.com.
The University of Washington is committed to providing access, equal opportunity and reasonable accommodation in its services, programs, activities, education and employment for individuals with disabilities. If you are a student with a documented disability and need to request disability accommodation(s) for your exam, please contact the Disability Services Office at least ten days in advance of your scheduled exam date at: 206.543.6450/V, 206.543.6452/TTY, 206.685.7264 (FAX), or e-mail at email@example.com.
If you would like to take a modern Chinese language course and are not currently enrolled in any UW Chinese language class, you must first complete the online Chinese Language Evaluation Questionnaire.
The Chinese Language Evaluation Questionnaire in now OPEN for Summer Quarter 2015 placement.
The Chinese Language Evaluation Questionnaire will open again for:
Summer Quarter 2015 placement CLOSED
Autmun Quarter 2015 placement May 1 - June 3
Once you have submitted your Questionnaire, you will receive an email indicating your status and including further directions. Notification is normally within five working days; we appreciate your patience.
- Note: if you find the Questionnaire closed, please check back again later. Or, if you get a "catalyst tools error" message when clicking on the link below, this simply means the questionnaire is currently closed.
- Note: if you wish to take classical Chinese you do NOT need to fill out the questionnaire.
We regret that non-matriculated students will not be considered for modern Chinese language classes at the first- through third-year level, with the exception of Summer courses.


text:
Cheap NYO to Raleigh flights
Popular Flights from Nykoping, Sweden
Top Nykoping Flights to US Destinations
Top Nykoping International Destinations
Popular Flights from Raleigh, North Carolina
Top Raleigh Flights to US Destinations
Top Raleigh International Destinations
NYO to RDU Route Map
Nykoping to Raleigh Flights, Stats and Airplanes
Route information for flights from Stockholm Skavsta to Raleigh Durham Intl..
4,328.02 miles
RDU - Raleigh Durham Intl. Airlines
Browse the most popular airlines servicing the Raleigh (RDU) airport. Visit their flights pages to learn more about the most popular routes these carriers fly.


text:
Again, Bob Allen at Ethics Daily does an outstanding job of calling attention to the call for "biblical patriarchy" at Southern Seminary. Here's a link to his story "Southern Baptist Professor Touts "Biblical Patriarchy".
Do the insecure, sexist men running the SBC know anything about the "new creation?" When will they ever acquire enough personal "power" to have the self-confidence to relate to women in Christian love as "equals?"


text:
As the area round gets under way for our baseball teams the, regional quarterfinals begin for the softball girls on Thursday night. Tomorrow the Coronado Mustangs will look to build on just their latest post season run.
The Mustangs seem to be hitting their stride after a nearly flawless weekend against Weatherford winning game one 6-0 and game two 11-0. In fact, the Mustangs have not allowed a single run in the playoff so far, outscoring their opponents 34-0.


text:
Outstanding Achievement in Education Awards
Lisa J. Heiser Award for Junior Faculty Contribution in Education
The Martin D. Abeloff Award for Lifetime Achievement in Medical and Biomedical Education
Outstanding Achievement in Education Awards
The IEE offers peer nominated and peer reviewed awards to recognize outstanding achievement in education. Awards are given at the annual IEE/SOM Education Conference and Celebration. Each award winner receives a certificate, and a $1000 honorarium.
David Cooke
David W. Cooke, MD
Jennifer Hayashi
Scholarship and Innovation
Jennifer Hayashi, MD
David Kern
Leadership and Mentoring
David E. Kern, MD, MPH
Cynthia Rand
Scholarship and Innovation
Cynthia S. Rand, PhD
Leadership and Mentoring
The Lisa J. Heiser Award for Junior Faculty Contribution in Education
This award is named in honor of Lisa J. Heiser, MA, NCC, LCPC, Assistant Dean for Faculty Development and Equity, Johns Hopkins Medicine. Lisa was the embodiment of what makes Johns Hopkins Medicine special; smart and multi-talented, combining fierce tenacity and commitment with tremendous personal warmth, friendliness and collegiality. In the short time that Lisa served as an assistant dean, she developed an impressive portfolio of programs and initiatives that have transcended the founding vision of her office, fostering the development of all faculty members. The Heiser award is given to one junior faculty member, on faculty five years or less, who has made an outstanding contribution in medical and biomedical education, and shown great promise for future meaningful contributions.
Nicole Shilkofski
Nicole Shilkofski, MD, MEd
The Martin D. Abeloff Award for Lifetime Achievement in Medical and Biomedical Education
This is the most distinguished of the IEE's awards and is meant to recognize a lifetime of achievement. It is awarded by the IEE Board of Directors to recognize that achievement.
Edward Miller
Please contact us if you or someone you know has received a teaching or educational award or received recognition, by sending us a message with all the details.


text:
20% Member Discount on ALL merchandise items;
does not apply to memberships or tickets.
WFMA orders are handled by MageeNET. You will see MageeNET as the merchant listed on your credit card statement. For inquiries, call toll free: (866) 412-5943.
Refund Policy: No Refunds. Defective merchandise can be exchanged for like item.
Accepted Payment Methods


text:
DJ Ron
100 - 500 downloadsAdd this app to your listsTweets por @Appszoom
When you care enough to listen to the very best, check out the DJ Ron app! Based in Nashville, DJ Ron Slomowicz is the guide for dancemusic.about.com and spins music and video. Weekly residencies include Play Dance Bar and Tribe along with mixshows on WRVU and WRFN. With the DJ Ron app you can:rn- Stream DJ Ron's Picks of the Weekrn- Check out DJ Ron's Videosrn- Listen to streamed radio sets rn- Stay up to date with DJ Ron's tour dates and eventsrn- See the latest Photos of DJ Ronrn- Connect with DJ Ron on Twitter, Facebook, & More
Tags: hd wallpapers dj ron, ron на андроид.
Tags: hd wallpapers dj ron, ron на андроид.
Comments and ratings for DJ Ron
- There aren't any comments yet, be the first to comment!


text:
A system and method is provided wherein a user chooses from an allowed preselected domain of query element values, presenting a query comprising a plurality of selected query element values, which form the basis for indexing query results. A database lookup is done according to the user's selections and index values, as well as relevancy values of other members of the allowed preselected domain of query element values. In some embodiments the query results are assigned to arbitrary tags or numbers to prevent unauthorized competing search providers from appropriating the query results.
1. A method for processing database queries, comprising:
presenting, to a user, a plurality of query elements, each query element having a plurality of allowed query element values;
receiving, from the user, a plurality of selected query element values, each selected query element value corresponding to a respective query element, wherein the value of each selected query elements is selected by the user from the respective plurality of allowed query element values corresponding to the respective query elements;
indexing a database by forming an index from the selected query element values; and
retrieving, from the database, information objects corresponding to the index.
2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
12. The method of
13. The method of
14. The method of
15. The method of
16. The method of
17. The method of
18. The method of
19. A system for processing a database query, comprising:
a server;
a client coupled to the server through a network;
a database coupled to the server, the database comprising information objects;
a user interface running on the client for presenting query results to a user;
a selector, implemented in the user interface, for allowing the user to select a plurality of selected query element values from respective pluralities of allowed query element values for respective query elements; and
an indexer for forming an index to the database, using the selected query element values.
20. The system of
21. The system of
22. The system of
23. The system of
24. The system of
25. The system of
26. The system of
27. The system of
28. The system of
29. The system of
30. The system of
31. The system of
32. The system of
33. The system of
34. The system of
35. The system of
36. The system of
[0001] The present application claims the benefit, under 35 U.S.C. �119(e), of U.S. Provisional Application Serial No. 60/230,354, filed Sep. 6, 2000, and entitled "System and Method for Processing Database Queries" which is hereby incorporated by reference.
[0002] The field of the invention relates generally to databases, and more particularly to processing database queries.
[0003] Computer systems having databases are generally used to store and obtain information. These computer systems may be stand-alone computers that serve one or more users, or the systems may be networked to provide access to a database from multiple systems referred to as clients. These database systems carry out communication with clients through one or more communication protocols, as is known in the art. For example, these database and clients may communicate over a network, such as the Internet, using the well-known TCP/IP protocol. The client systems may interact with the database using one or more application programs such as an Internet browser which accepts input from a user and display information received from database systems. The database may be, for example, a relational database which stores character, binary, or other data format that may be searched and retrieved.
[0004] Database access has become standard for supporting operations performed on networks such as the Internet. For example, databases are used to support searching, by providing a resource which stores links to data resources and to other databases. For example, databases are used to classify and store links, called Uniform Resource Locators (URLs) that serve as addresses to resources such as Web sites, audio/video files, and other types of media. These addresses are provided by database systems in response to queries submitted to the database systems through interfaces to the database systems displayed in browser applications. These database systems are sometimes referred to as search engines, and may be used as a part of a directory service, company's Web site, or any other method for searching and retrieving information.
[0005] Interfaces for databases generally include a text entry field, wherein a user may enter one or more keywords associated with what he or she is searching for. These keywords are processed by the database system, and a set of results is displayed to the user. The user then reviews these results to determine how pertinent the results are to what he or she is looking for. These databases function as a directory services for resources on the Internet. Examples of such searching systems include Yahoo! (www.yahoo.com), Google (www.google.com), and others. Yahoo! and other search engines generally provide two methods for finding information. First, a directory method, which provides pathways for navigating through content related by a logical relationship. The second method is a key word search. Some services such as Yahoo! utilize the catalog information provided by other services such as Google for performing the search.
[0006] One main problem with existing systems that use the directory search method is that a user must navigate hierarchical directory structures. Taking a "wrong" or a non-ideal "turn" in the search path, by selecting a branch in the search which leads away from the best result, will significantly degrade the final outcome of the user's search.
[0007] Keyword search systems generally accept keyword entry and display a number of results, the results being ordered based upon the frequency of the keyword appearing in the resource, or some other ranking criteria. The database systems perform preprocessing on the resources by indexing data of the resources by keywords. This involves analyzing Internet resources with programs referred to as Web spiders or crawlers which visit Internet links and perform keyword processing on resource content associated with the link, generally involving millions of processed resources. Furthermore, a perplexingly large number of search results is typically returned by such keyword search engines. Thousands of search results are usually presented to the user, and the sorting of the search results can involve errors due to the automated indexing of the search results or the difficulties described above.
[0008] Further, more simple keyword association and relevancy also produce irrelevant results sometimes. When documents are retrieved based upon a keyword search, resources such as documents having those combination of keywords are retrieved, even though the documents' content may not be relevant. A user must evaluate individually each link to determine whether an indicated document is relevant. Also, the number of records produced is generally large, and a query retrieving thousands of records is not uncommon. Retrieving large number of records is problematic to a user, as the process of reviewing each link is tedious and time-consuming for the user and requires excessive computational resources.
[0009] Keywords and other natural language (NL) inputs are generally processed by the system as shown in FIG. 1, which shows a conventional NL searching system 10. Natural language searches generally begin with a user 100 entering an unstructured query 102 into an interface associated with the database search system. A NL query preprocessor 104 processes the unstructured query 102 to determine the meaning of the query. This meaning is formulated into predetermined search criteria 106, which are provided to a query keyword parser 108, which associates meaning for each of the keywords, and may expand the query by generating similar terms for one or more keywords. The unstructured query 102 is also passed directly to the query keyword parser 108 that processes the unstructured query 102 to determine keywords and logical operators 110 connecting those keywords. For example, an input query of "map and Massachusetts" might produce, by the query keyword parser 108, the keywords "map" and "Massachusetts" with a logical operator "and." The NL query preprocessor 104 may also determine that the user wants driving directions for Massachusetts, or to retrieve maps of major metropolitan areas, based on the meaning of the phrase "map and Massachusetts."
[0010] A database 150 is indexed by keywords in this case, and those keywords and logical operators are compared to that of the keyword index to produce a (typically large) number of search results 118. These search results 118 are presented to the user 100 by a query result presenter 120, within a graphical user interface, and are generally ranked by relating the keywords to the database entries.
[0011] As discussed above, search engines may include a NL query preprocessor 104 which attributes some meaning to the terms. For instance, this may be performed through analyzing lexical semantics which determines the meanings of each of the keywords, and by analyzing compositional semantics which is the knowledge of how keywords are combined to form larger meanings. In general, morphology is the study of the meaningful components of words, while syntax is the study of the relationship between words. There are also many other ways to analyze natural language. For example, semantics is the study of meaning, pragmatics is the study of how language is used to accomplish goals, and discourse is the study of linguistic units larger than a single utterance.
[0012] Because meaning may be attributed to a query at many levels, NL processing is a complex process which involves complex algorithms. Further, these algorithms are not perfect; there are frequent ambiguities in natural language interpretation. Because of these ambiguities, and because of the inherently subjective nature of database queries, NL processing of input queries yields imperfect search results. Natural language processing is more fully described in the book entitled "Natural Language Understanding" by James Allen, 2nd edition (January 1995), Addison-Wesley Publishing Co., which is hereby incorporated by reference.
[0013] As discussed, there are many drawbacks of implementing NL in association with database searching. For example, the user may pose a question, and the question is not interpreted properly, yielding incorrect results. The user may need to restructure the question in a different manner to obtain meaningful results.
[0014] There are sites that implement NL analysis such as the portal AskJeeves (www.askjeeves.com), which ascribes meaning to input queries by matching a user's question to a question that was previously defined. This portal allows a user to pose questions in a NL format, and retrieves the most relevant question based on a keyword analysis. However, as discussed above, natural language analysis produces ambiguous results and is complicated to perform. Thus, AskJeeves, and others, do not generally perform a perfect match. Further, questions posed to the system by a user do not necessarily have a corresponding question predefined in the system. Also, sample questions presented to the user in response to a query are usually not relevant. Because AskJeeves is linked to a keyword indexed database, the results returned must be processed by the user, and the AskJeeves system produces the same volume of information as standard keyword matching search engines.
[0015] Many database search engines also, in addition to keyword-based and NL-based search functions, provide a hierarchical listing of information to compliment these functions. This hierarchical listing is a categorization of links, usually programmed manually and take the form of directories. When new links are added, they are generally placed within the predetermined hierarchy or directory tree. As described earlier, navigating through a directory tree requires a user to accurately choose the best choice from a plurality of presented choices. The presented choices may themselves not include a choice corresponding to a path leading to the information the user actually desires to find. Making a non-ideal selection or being presented with selections none of which are ideal, forces a user down a search path that will not lead to the desired results. Also, excessively long search paths involving many user selections are generally required to reach the end point of a search. No logical relationship necessarily exists between members of a directory level or members of different directory levels. These difficulties cause directory-based search engines or navigators to be an inefficient means for retrieving information.
[0016] According to one embodiment of the invention, a system and method is provided wherein common elements of questions, or "queries", are used to assist users in constructing their questions. In particular, users select a "query element" value from a list of allowed values, or a "domain," of each query element. Instead of using keywords and determining their relevancy to elements in a database, user-selected values of query elements of a query are used to retrieve indexed results from the database system. The database system may be, for example, a relational classification system. Information may be stored in the database by classifying the information by assigning, for an information object of the database, a number of values for each query element. Also, a relevancy index may be assigned among the allowed values of a query element, if multiple values of a query element are possible. According to one aspect of the invention, the query submitted by a user is restricted to one of a plurality of predefined formats and allowed values, and the predefined formats and allowed values are associated with database information objects.
[0017] Because it is the user's responsibility to properly phrase a query or search criteria in a text-free format, conventional systems perform only as good as the input provided by the user. According to various embodiments of the present invention, the query response information is provided in a non-hierarchical format, such that the user does not need to traverse directories or hierarchies to find the requested information.
[0018] Further, the amount of calculation carried out by the server to respond to a query and retrieve information is often far less than that required by standard keyword-parsing and NL-processing systems. Additionally, the database needed to store the information is reduced.
[0019] Some embodiments call for a human or a machine "editor" to sort and assign relevance values to query element values. This way an optimized first-time query brings up only the most relevant database search results.
[0020] Also, Internet links may be represented by arbitrary numbers, or codes, to prevent other Internet services from directly copying the search results. That is, to hide content from other Internet services, results such as links that are returned to the user are assigned arbitrary numbers used by the system to refer to the actual links.
[0021] Additionally, state information may be associated with the links and maintained by the server. In this way outdated links could be tracked and the system can determine the last date a link was checked, or whether a link was found valid, invalid, or had any other condition worthy of reporting. Accordingly, some embodiments of the invention are directed to:
[0022] A method for processing database queries, comprising: presenting, to a user, a plurality of query elements, each query element having a plurality of allowed query element values; receiving, from the user, a plurality of selected query element values, each selected query element value corresponding to a respective query element, wherein the value of each selected query elements is selected by the user from the respective plurality of allowed query element values corresponding to the respective query elements; indexing a database by forming an index from the selected query element values; and retrieving, from the database, information objects corresponding to the index.
[0023] A system for processing a database query, comprising: a server; a client coupled to the server through a network; a database coupled to the server, the database comprising information objects; a user interface running on the client for presenting query results to a user; a selector, implemented in the user interface, for allowing the user to select a plurality of selected query element values from respective pluralities of allowed query element values for respective query elements; and an indexer for forming an index to the database, using the selected query element values.
[0024]FIG. 1 shows a block diagram of a conventional NL search engine.
[0025]FIG. 2 shows a general purpose client-server computer system upon which various embodiments of the invention may be practiced.
[0026]FIG. 3 shows an exemplary user interface in accordance with one embodiment of the invention.
[0027]FIG. 4 shows two exemplary query elements and allowed query element values and selected query element values which can be selected using the selector.
[0028]FIG. 5 shows a block diagram of a search system in accordance with one embodiment of the invention.
[0029]FIG. 6 shows a logical data model that may be implemented in the system shown in FIG. 3.
[0030]FIG. 7 shows a table mapping link information, the table being maintained by a search system.
[0031] The present invention will be more completely understood through the following description, which should be read in conjunction with the accompanying drawings, in which similar reference numbers indicate similar structures.
[0032]FIG. 2 shows a computer system 20 suitable for implementing various embodiments of the present invention. One or more client systems 209A-B communicate with one or more server systems 210A-B for the purposes of exchanging information and performing transactions, such as database transactions. These systems communicate using a communication protocol over a network 200. Server 210 may be, for example, a hypertext transfer protocol (HTTP) server that is configured to perform database transactions. The servers 210 may accept and process search queries received from a user. In particular, a user may provide and receive, respectively, input/output through an interface of a client 209 system. The query information is transferred over the network 200 and stored and processed at one or more servers 210 using one or more communication protocols, such as TCP/IP and one or more transfer protocols such as HTTP. Other protocols are available as known or as becomes known to those skilled in the art.
[0033] The communication network 200 may be an Ethernet network, Fast Ethernet or other type of local or wide area network (LAN or WAN), a point-to-point network provided by telephone services, or other type of communication network or combination of networks. Information consumers and providers, also referred to in the art as client and server systems, respectively, communicate through the network 200 to exchange information.
[0034] Computer system 201 may include a processor 202 connected to one or more storage devices 203, such as a disk drive, through a communication device, such as a bus 207. The computer system 201 may also include one or more output devices 204, such as a monitor, printer, or graphic display, or printing device and one or more input devices 208 such as a keyboard, mouse or other device. The computer system 201 typically includes a memory 205 for storing programs and data during operation of the computer system 201. In addition, the computer system may contain one or more communication devices 206 that connect the computer system 201 to the communication network 200.
[0035] Computer system 201 may be a general purpose computer system that is programmable using a high-level computer programming language. The computer system 201 may also be implemented using specially-programmed, special-purpose hardware. In computer system 201, the processor 202 is typically a commercially-available processor, such as those available from the Intel Corporation, Sun Microsystems, or Motorola. The processor 202 usually executes an operating system which may be, for example, those available from the Microsoft Corporation, Apple Computer, Sun Microsystems, Palm, Inc. or other UNIX-based operating systems available from various sources.
[0036] It should be understood that the invention is not limited to a particular platform, processor, operating system, or network. Also, it should be apparent to those reading this application that the present invention is not limited to a specific programming language or computer system and that other appropriate programming languages and other appropriate computer systems could also be used.
[0037] In this application we generally consider that a database search operation, or query, is facilitated by breaking down the query into a plurality of query elements 400. The query elements 400 are predefined and comprise a set of allowed query elements 302. A user 100 uses a selector 510 built into a user interface 303 to select individual values from a domain comprising the allowed query elements 302. A particular chosen query element value, which is chosen from the domain or list of allowed query element values 302, is referred to as a selected query element value 430. Thus, the user 100 chooses a selected query element value 430 from the list of allowed query element values 420 which are defined for each query element 400.
[0038]FIG. 3 shows an example graphical user interface 50 according to one embodiment of the invention. An interface is provided that displays query elements 400 and a list of allowed query element values associated therewith. The list may be displayed, for example, using a selector 510, such as a data selection box, having a drop down list containing all of the allowed query document values 420. The selector 510 may also accept free text, and display matching values associated with the free text entry. Drop down boxes, menus, and text entry field are examples of methods for accepting selection information from users. It should be understood that other methods for conveying or displaying the query elements 400 and their allowed values 420 may be used. By limiting the user 100 to predetermined allowed query element values 420, the system guides the user 100 in properly forming queries, and obtaining more relevant results. The user interface 50 may be implemented, for example, using HTML, XML or other ways for representing user interfaces.
[0039]FIG. 4 shows two query elements 400 in more detail. An exemplary "Do" and "What" query elements 400 illustrate how a query element 400 can have several allowed query element values 420 from which a user 100 can select a selected query element value 430. Here, the "Do" query element 400 is associated with a selector 510 that drops down a list of allowed query element values 420, or a domain. The allowed query element values 420 include the entries "Apply for; Renew; Inquire about, Cancel; File for; Report lost." From this list of allowed query element values 420, the selected query element value 430 "Renew" is chosen. Similarly, the "What" query element 400 is associated with a selector 510 that allows a user 100 to choose from preassigned allowed query element values 420. In this example the "What" query element 400 is associated with allowed query element values 420 "401K; Tax return; Social security; Driver's license; Passport." The query element value "Driver's license" has been selected as the selected query element value 430 for the "What" query element 400.
[0040] Other query elements 400, such as those depicted in FIG. 4, can be similarly assigned a selected query element value 430 for each. Note that it is possible for a user 100 to make no selection for one or more query elements 400 in some embodiments.
[0041] Additionally, each individual query element value may be assigned a query element relevancy 425. The query element relevancy 425 is a measure of the relevance of any individual query element value to others in the same domain or list of allowed query element values 420. Assigning such relevancy 425 can be helpful in guiding a user 100 through the query process, and in presenting and ranking other relevant query results for the user 100.
[0042]FIG. 5 shows a block diagram of a database query system 30, sometimes referred to as a "vortal" search service, that performs a database query according to one embodiment of the invention. Server 301, upon which various aspects of the invention may be implemented, may be for example, a general purpose computer system, as described above with reference to FIG. 2. Server 301 collects information provided by one or more clients 209. The clients 209 may be coupled to, or in use by a user 100. Clients 209 may also be general purpose computers.
[0043] According to one aspect of the invention, server 301 provides a user interface 303 through which database queries are performed. This user interface 303 may be, for example, a hypertext markup language (HTML) interface presented on a query result presenter, such as a Web browser. A structured query constructor 304 may be provided to facilitate the formulation of queries into query elements 400. Other types of interfaces are available. The user interface 303 allows the user 100 to select from a plurality of allowed query element values 420 for various query elements 400. By selecting a particular element/value combination, a query is defined. The query elements 400 and values are provided to a query element-indexed searcher 112, which accesses the database 150 by using query elements 400 and their selected query element values 430 as an index. The database 150 may be indexed, for example, manually by an editor, human or machine, or by a database administrator. The query results 118 of the query are then presented as ranked displayed results 322 to the user 100, and may be presented according to relevance by a query result presenter 120. The query results 118, for example, may be one or more information objects from the database 150 such as links.
[0044] In one embodiment of the invention, a relevancy is determined for each database object for domains having multiple possible values. In this manner, the query is executed based on values specified for each element against the classification of the information in the database rather than the information itself. Because keywords do not have to be indexed or NL analysis performed, search time is reduced. Also, because more relevant information is indexed, the result displayed to the user is more relevant, and unnecessary effort reviewing irrelevant links is not required.
[0045] It should be understood that one or more components of database query system 30 may be implemented on one or more systems, and the invention is not limited to a single system. For instance, the database 150 may be implemented on a separate general purpose computer system that communicates with the database query system 30 through a communications network 200. Other configurations of the system are possible.
[0046]FIG. 6 shows a logical data model 40 that may be implemented in the system 30 shown in FIG. 5. A query element 400 is provided which is used to describe an aspect of the query to be performed on a database 150. For example, a query to be asked of the database may comprise one or more of the following query elements 400:
[0047] Who (element 1): the subject of the question
[0048] Do (element 2): the action performed
[0049] What (element 3): the object of the action
[0050] Where (elements 4): the location for the action
[0051] When (element 5): when the action was or will be performed
[0052] In the context of a special purpose Internet site such as a government-related Internet site that handles processing of drivers' licenses, auto registrations, passports, tax returns, postal services, social security, and other aspects of government, the following query elements 400 and allowed values may be preassigned:
[0053] For example, a user 100 may construct a query using the allowed query elements 420 and corresponding selected query element values 430 such as "[I] [apply for] [passport] [in U.S.]" or "[I] [renew] [driver's license] [in Massachusetts]." Sometimes the database 150 is indexed by the query elements 400 and the corresponding selected query elements 430 values, thus keyword or NL interpretation is not required.
[0054] Data may be classified in the database 150 by assigning or associating more than one value for each query element 400. For example, a Massachusetts driver's license application form (or reference or link thereto) may be stored as an information object in the database 150, and may be indexed by the following query elements 400 and their selected query element values 430:
[0055] Therefore, a user 100 requesting any information with [apply for] [driver's license] and [MA] as "To", "What", and "Where" elements will retrieve database information objects indexed by these query elements 400. In the database 150, an example entry for a database information object, such as a Uniform Resource Locator (URL) or a link associated with applying for a driver's license in Massachusetts may have the following entry:
[0056] <link information><All><apply for><driver's license><MA><not applicable>As discussed, a relevancy 425 may be assigned among all the possible allowed query element values 420 for a query element 400 which will allow the system to determine the most relevant response to a query. For example, the "To" element may have two allowed query element vales 430—"Apply for" and "Renew." A 60% relevancy may be assigned to both values, such that if a user 100 selects "Apply for" as the selected value of the "To" query element 400, the information object assigned a value of "Renew" for the "To" element will also be retrieved, along with the "Apply for" information object. Because the user 100 specified "Apply for," the database entries associated with the query element "Apply for" are assigned a relevancy value of 100% (a direct hit). Those database entries having a related query element will be displayed according to their assigned relevancy 425. Thus, a relevancy 425 may be assigned based on relevancy between query elements 400. This relevancy 425 may be assigned, for example, when database 150 entries are classified.
[0057] According to another aspect of the invention, the query results 118 returned to the user 100 are arbitrary numbers that are used by the system to refer to the actual links. In this manner, other Internet services are prevented from stealing query content, such as search results, from the database server 301. According to one embodiment of the invention, each link is assigned an arbitrary number, and the arbitrary number is associated with the actual link through a mapping that may be stored, for example, on the database server in a mapping table 601. The clients 209 query the server 301 and obtain query results 118, which include links that contain the address of a server and the arbitrary numbers instead of the actual links. When a user 100 selects a link, the resulting link request is brokered by the server 301 to the corresponding destination. That is, the server 301 performs the request on behalf of the client 209, and the content is returned by the server 301 to the client 209. The server 301 may also filter and replace that content, such that the client 209 does not obtain actual links; that is, the server 301 provides substituted links. Another way to think of this is to consider that information objects retrieved from the database 150 are mapped into mapped information objects.
[0058] Further, the mapping table 601 may also include other state information relating to the link, such as last check time 604 and last check status 605. In this way, state information for the links may be maintained by the server 301, and the server 301 may determine if these links are still valid.
[0059]FIG. 7 shows an example of a mapping table 601 for mapping link information, the table 601 being maintained by, for example, the search system 30 shown in FIG. 5. The table 601 includes link information 602 which may be URL information indicating the location of a resource. Associated with each URL is an arbitrary identification (ID) number 603 which is provided to a user 100 in response to queries. ID number 603 may be, for example, a unique identifier used to uniquely identify a URL. ID number 603 may also be assigned sequentially by the database system 30. For example, ID number 603 may be appended to the address of the server 301, and when a user 100 selects a link of the response, the user 100 is directed to the arbitrary link assigned by the server 301. The server 301, in response to the request for the arbitrary link, accesses the mapping in the table 601, and obtains the content requested. The server 301 may also filter content by replacing links with arbitrary ID numbers 603 as the information is returned to the client 209 or the user 100.
[0060] Table 601 includes link state information such as last checked information 604 which indicates when the link was last checked. State information may also include a last check status 605 which indicates the status of the link at the time at which the link was last checked. It should be understood that other methods for maintaining link information may be used.
[0061] Having now described a few embodiments of the invention, it should be apparent to those skilled in the art that the foregoing is merely illustrative and not limiting, having been presented by way of example only. Numerous modifications and other embodiments are within the scope of ordinary skill in the art and are contemplated as falling within the scope of the invention as defined by the appended claims and equivalents thereto.
Referenced by
Legal Events
Original Image


text:
"Rugrats" and "All That" were the big winners at Nickelodeon's 12th annual "Kids' Choice Awards" honoring youngsters' favorite programs, movies and celebrities.
"All That" picked up honors Saturday night in Westwood for favorite TV show and favorite TV actor for its Kel Mitchell, while the "Rugrats" TV show and movie were voted favorite cartoon and favorite movie, respectively.
Rosie O'Donnell hosted the ceremony at UCLA's Pauley Pavilion, where awards were given out to youngsters' favorites in 17 movie, television, music, sports, book and video game categories.
Favorite group honors went to 'N Sync, while favorite singer went to Will Smith. Adam Sandler and Drew Barrymore were voted best actor and actress, respectively.


text:
There are currently no items in your cart.
Teacher's Partner: Basic Flute Studies, first year
- Look inside(1) Listen (2)
- Instrument:
- Series:
Teacher's Partner: Basic Flute Studies, first year for flute. Instrumental Solo Part and CD. Published by Music Minus One (MO.MMOCD3334).
An album designed for the beginning student facing problems of tone, rhythm and articulation. In presenting a professional model, this recording is best introduced as soon as the student has started scales or has progressed in his/her method book to where review will help solidify basic technique and sustain interest in practicing. Practice becomes exciting and rewarding with this approach.Contains scales in varied articulations, solos and duets with piano accompaniment. Covers first year of study and can be used with any method book.
Includes a high-quality printed solo part; and a compact disc containing examples and accompaniments for each piece.
For related items see the following item numbers: MMOCD3142, MMOCD3231, MMOCD3823, MMOCD3920, MMOCD4119
- Flute Tuning Instructions
- Play from C to G and Back
- Courtly Dance (solo in C major) Performed by Louis Gordon
- F-major scale (whole notes; then quarter notes; then half notes)
- Solitude (solo in F major) Performed by Louis Gordon
- Perky Miss (duet in F major) Performed by Louis Gordon
- G-major scale (half notes; then quarter notes/rests; then eighth notes)
- March of the Toys (solo in G major) Performed by Louis Gordon
- Graceful Partners (duet in G major) Performed by Louis Gordon
- C-major scale (dotted whole notes; then quarter, sixteenth and eighth notes)
- Burlesca (solo in C major) Performed by Louis Gordon
- Wistful Dream (duet in C major) Performed by Louis Gordon
- B-flat-major scale (whole notes; then sixteenth notes)
- Go, Go West (solo in B-flat major) Performed by Louis Gordon
- Igor Centric (duet in B-flat major) Performed by Louis Gordon
- A-flat-major scale (a half, quarter and two eighth notes; then a quarter note and two eighths; then a dotted quarter and an eighth)
- Romance (solo in A-flat major) Performed by Louis Gordon
- Canon in A-flat major (duet) Performed by Louis Gordon
- Octave Skips
- Scale Cycle (5 scales)
- French Waltz (duet) Performed by Louis Gordon
- Flute Graduation Piece Performed by Louis Gordon
Customers Who Bought Teacher's Partner: Basic Flute Studies, first year Also Bought:
Teacher's Partner: Basic Flute Studies, first year
- Explain exactly why you liked or disliked the product. Do you like the artist? Is the transcription accurate? Is it a good teaching tool?
- Consider writing about your experience and musical tastes. Are you a beginner who started playing last month? Do you usually like this style of music?
- Feel free to recommend similar pieces if you liked this piece, or alternatives if you didn't.
- Be respectful of artists, readers, and your fellow reviewers. Please do not use inappropriate language, including profanity, vulgarity, or obscenity.
- Avoid disclosing contact information (email addresses, phone numbers, etc.), or including URLs, time-sensitive material or alternative ordering information.
- We cannot post your review if it violates these guidelines. If you have any suggestions or comments on the guidelines, please email us.
- All submitted reviews become the licensed property of Sheet Music Plus and are subject to all laws pertaining thereto. If you believe that any review contained on our site infringes upon your copyright, please email us.
- Read Sheet Music Plus's complete Privacy Policy
Teacher's Partner: Basic Flute Studies, first year
Tell a friend (or remind yourself) about this product. We'll instantly send an email containing product info and a link to it. You may also enter a personal message.
We do not use or store email addresses from this form for any other purpose than sending your share email.
Read our Privacy Policy.
Make a wish list for gifts, suggest standard repertoire, let students know which books to buy, boast about pieces you've mastered: Music Lists are as unique as the musician! Easily share your music lists with friends, students, and the world.
To create a music list, please sign in.Existing Accounts
Sign In and Add to My Music ListNew Accounts
See Similar Sheet Music
Instrument: Flute Sheet Music
Format: Accompaniment CD Play Along Solo Part Teacher Editions
Series: Music Minus One