Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
8th Edition
ISBN: 9781259676512
Author: Kenneth H Rosen
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 3, Problem 35SE
To determine
(a)
Extend the stable matching to cover case where there are unequal number and women.
To determine
(b)
Adapt the (a) algorithm.
To determine
(c)
Prove all matching produce by algorithm (b).
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Which of these settings does not allow use of a matched pairs ?t procedure?
1)You interview 64 female students in their freshman year and again in their senior year and ask each about their ideal number of children.
2)You interview 64 female students and their mothers and ask each about their ideal number of children.
3)You interview both the husband and the wife in 64 married couples and ask each person about their ideal number of children.
4)You interview a sample of 64 unmarried male students and another sample of 64 unmarried female students and ask each about their ideal number of children.
Dogs are inbred for such desirable characteristics as blue eye color; but an unfortunate by-product of such inbreeding can be the emergence of characteristics such as deafness. A 1992 study of Dalmatians (by Strain and others, as reported in The Dalmatians Dilemma) found the following:
(i)
31% of all Dalmatians have blue eyes.
(ii)
38% of all Dalmatians are deaf.
(iii)
42% of blue-eyed Dalmatians are deaf.
Based on the results of this study is "having blue eyes" independent of "being deaf"?
No, since .31 * .38 is not equal to .42.
No, since .38 is not equal to .42.
No, since .31 is not equal to .42.
Yes, since .31 * .38 is not equal to .42.
Yes, since .38 is not equal to .42.
Submit QuestionQuestion 13
Suppose the Economics Department has a graduation party for its students but as a final test they must show they have learned something about trade. Students in group A are given food (F) when they walk in, and students in group B are given a drink (D).
Refer to Scenario 1. Suppose that all members of both groups have identical preferences where food and drink provide utility U = FαDβ. The exchange would be such that
(a) both would be guaranteed to be better off than when they entered.(b) both would be guaranteed to be at least as well off as when they entered.
(c) students in group A would end up with more utility.
(d) students in group B would end up with more utility.
Chapter 3 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Ch. 3.1 - List all the steps used by Algorithm 1 to find the...Ch. 3.1 - Determine which characteristics of an algorithm...Ch. 3.1 - Devise an algorithm that finds the sum of all the...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Apalindromeis a string that reads the same forward...Ch. 3.1 - Devise an algorithm to computexn, wherexis a real...
Ch. 3.1 - Describe an algorithm that interchanges the values...Ch. 3.1 - cribe an algorithm that uses only assignment...Ch. 3.1 - List all the steps used to search for 9 in the...Ch. 3.1 - List all the steps used to search for 7 in the...Ch. 3.1 - cribe an algorithm that inserts an integerxin the...Ch. 3.1 - Describe an algorithm for finding the smallest...Ch. 3.1 - Describe an algorithm that locates the first...Ch. 3.1 - Describe an algorithm that locates the last...Ch. 3.1 - Describe an algorithm that produces the maximum,...Ch. 3.1 - Describe an algorithm for finding both the largest...Ch. 3.1 - Describe an algorithm that puts the first three...Ch. 3.1 - Prob. 22ECh. 3.1 - Prob. 23ECh. 3.1 - Describe an algorithm that determines whether a...Ch. 3.1 - Describe an algorithm that will count the number...Ch. 3.1 - nge Algorithm 3 so that the binary search...Ch. 3.1 - Theternary search algorithmlocates an element in a...Ch. 3.1 - Specify the steps of an algorithm that locates an...Ch. 3.1 - Devise an algorithm that finds a mode in a list of...Ch. 3.1 - Devise an algorithm that finds all modes. (Recall...Ch. 3.1 - Two strings areanagramsif each can be formed from...Ch. 3.1 - ennreal numbersx1,x2,...,xn , find the two that...Ch. 3.1 - Devise an algorithm that finds the first term of a...Ch. 3.1 - Prob. 34ECh. 3.1 - Prob. 35ECh. 3.1 - Use the bubble sort to sort 6, 2, 3, 1, 5, 4,...Ch. 3.1 - Use the bubble sort to sort 3, 1, 5, 7, 4, showing...Ch. 3.1 - Use the bubble sort to sortd,f,k,m,a,b, showing...Ch. 3.1 - Adapt the bubble sort algorithm so that it stops...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Sort these lists using the selection sort....Ch. 3.1 - Write the selection sort algorithm in pseudocode.Ch. 3.1 - Describe an algorithm based on the linear search...Ch. 3.1 - Describe an algorithm based on the binary search...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - Show all the steps used by the binary insertion...Ch. 3.1 - Compare the number of comparisons used by the...Ch. 3.1 - Prob. 51ECh. 3.1 - Devise a variation of the insertion sort that uses...Ch. 3.1 - Prob. 53ECh. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Prob. 59ECh. 3.1 - Show that if there were a coin worth 12 cents, the...Ch. 3.1 - Prob. 61ECh. 3.1 - Prob. 62ECh. 3.1 - Devise a greedy algorithm that determines the...Ch. 3.1 - Suppose we have three menm1,m2, andm3and three...Ch. 3.1 - Write the deferred acceptance algorithm in...Ch. 3.1 - Prob. 66ECh. 3.1 - Prob. 67ECh. 3.1 - Prob. 68ECh. 3.1 - Prove that the Boyer-Moore majority vote algorithm...Ch. 3.1 - Show that the problem of determining whether a...Ch. 3.1 - Prob. 71ECh. 3.1 - Show that the problem of deciding whether a...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Prob. 11ECh. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - ermine whetherx3isO(g(x))for each of these...Ch. 3.2 - Explain what it means for a function to be 0(1)Ch. 3.2 - w that iff(x)isO(x)thenf(x)isO(x2).Ch. 3.2 - Suppose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - kbe a positive integer. Show...Ch. 3.2 - Prob. 19ECh. 3.2 - To simplify:(3a5)3 27a15 Given information:(3a5)3....Ch. 3.2 - ange the functionsn, 1000 logn,nlogn,2n!,2n,3n,...Ch. 3.2 - Arrange the...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Give as good a big-Oestimate as possible for each...Ch. 3.2 - e a big-Oestimate for each of these functions. For...Ch. 3.2 - Give a big-Oestimate for each of these functions....Ch. 3.2 - each function in Exercise 1, determine whether...Ch. 3.2 - Prob. 29ECh. 3.2 - Show that each of these pairs of functions are of...Ch. 3.2 - Prob. 31ECh. 3.2 - w thatf(x)andg(x)are functions from the set of...Ch. 3.2 - Prob. 33ECh. 3.2 - Show that3x2+x+1is(3x2)by directly finding the...Ch. 3.2 - Prob. 35ECh. 3.2 - lain what it means for a function to be(1).Ch. 3.2 - Prob. 37ECh. 3.2 - Give a big-Oestimate of the product of the...Ch. 3.2 - Prob. 39ECh. 3.2 - Prob. 40ECh. 3.2 - Prob. 41ECh. 3.2 - pose thatf(x)isO(g(x)). Does it follow...Ch. 3.2 - Prob. 43ECh. 3.2 - pose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - Prob. 45ECh. 3.2 - Prob. 46ECh. 3.2 - Prob. 47ECh. 3.2 - ress the relationshipf(x)is(g(x))using a picture....Ch. 3.2 - Prob. 49ECh. 3.2 - w that iff(x)=anxn+an1xn1++a1x+a0,...Ch. 3.2 - Prob. 51ECh. 3.2 - Prob. 52ECh. 3.2 - Prob. 53ECh. 3.2 - w thatx5y3+x4y4+x3y5is(x3y3).Ch. 3.2 - w thatxyisO(xy).Ch. 3.2 - w thatxyis(xy).Ch. 3.2 - Prob. 57ECh. 3.2 - Prob. 58ECh. 3.2 - Prob. 59ECh. 3.2 - Prob. 60ECh. 3.2 - Prob. 61ECh. 3.2 - (Requires calculus) Prove or disprove that (2n)!...Ch. 3.2 - Prob. 63ECh. 3.2 - Prob. 64ECh. 3.2 - Prob. 65ECh. 3.2 - Prob. 66ECh. 3.2 - Prob. 67ECh. 3.2 - Prob. 68ECh. 3.2 - Prob. 69ECh. 3.2 - Prob. 70ECh. 3.2 - Prob. 71ECh. 3.2 - Prob. 72ECh. 3.2 - Show thatnlognisO(logn!).Ch. 3.2 - Prob. 74ECh. 3.2 - Prob. 75ECh. 3.2 - Prob. 76ECh. 3.2 - (Requires calculus) For each of these pairs of...Ch. 3.3 - Give a big-Oestimate for the number of operations...Ch. 3.3 - Give a big-Oestimate for the number additions used...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Prob. 5ECh. 3.3 - Use pseudocode to describe the algorithm that puts...Ch. 3.3 - Suppose that an element is known to be among the...Ch. 3.3 - Prob. 8ECh. 3.3 - Give a big-Oestimate for the number of comparisons...Ch. 3.3 - Show that this algorithm determines the number of...Ch. 3.3 - pose we havensubsetsS1,S2, ...,Snof the set {1, 2,...Ch. 3.3 - Consider the following algorithm, which takes as...Ch. 3.3 - The conventional algorithm for evaluating a...Ch. 3.3 - re is a more efficient algorithm (in terms of the...Ch. 3.3 - t is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - How much time does an algorithm take to solve a...Ch. 3.3 - Prob. 19ECh. 3.3 - What is the effect in the time required to solve a...Ch. 3.3 - Prob. 21ECh. 3.3 - Determine the least number of comparisons, or...Ch. 3.3 - Analyze the average-case performance of the linear...Ch. 3.3 - An algorithm is calledoptimalfor the solution of a...Ch. 3.3 - Describe the worst-case time complexity, measured...Ch. 3.3 - Prob. 26ECh. 3.3 - Prob. 27ECh. 3.3 - Prob. 28ECh. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Prob. 32ECh. 3.3 - Prob. 33ECh. 3.3 - Prob. 34ECh. 3.3 - Determine a big-O estimate for the worst-case...Ch. 3.3 - Determine the number of character comparisons used...Ch. 3.3 - Determine a big-Oestimate of the number of...Ch. 3.3 - Prob. 38ECh. 3.3 - Prob. 39ECh. 3.3 - Show that the greedy algorithm for making change...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - Prob. 43ECh. 3.3 - Prob. 44ECh. 3.3 - Prob. 45ECh. 3.3 - Prob. 46ECh. 3.3 - Prob. 47ECh. 3.3 - Prob. 48ECh. 3.3 - Prob. 49ECh. 3 - Define the termalgorithm. What are the different...Ch. 3 - Describe, using English, an algorithm for finding...Ch. 3 - Prob. 3RQCh. 3 - Prob. 4RQCh. 3 - Prob. 5RQCh. 3 - Define what the worst-case time complexity,...Ch. 3 - Prob. 7RQCh. 3 - Describe the bubble sort algorithm. Use the bubble...Ch. 3 - Describe the insertion sort algorithm. Use the...Ch. 3 - Explain the concept of a greedy algorithm. Provide...Ch. 3 - Prob. 11RQCh. 3 - Describe an algorithm for locating the last...Ch. 3 - Prob. 2SECh. 3 - Give an algorithm to determine whether a bit...Ch. 3 - Suppose that a list contains integers that are in...Ch. 3 - Prob. 5SECh. 3 - Prob. 6SECh. 3 - Prob. 7SECh. 3 - Prob. 8SECh. 3 - Prob. 9SECh. 3 - Prob. 10SECh. 3 - Show the steps used by the shaker sort to sort the...Ch. 3 - Express the shaker sort in pseudocode.Ch. 3 - Prob. 13SECh. 3 - Prob. 14SECh. 3 - Prob. 15SECh. 3 - w that8x3+12x+100logxisO(x3).Ch. 3 - Prob. 17SECh. 3 - Prob. 18SECh. 3 - Prob. 19SECh. 3 - w thatnnis notO(n!).Ch. 3 - Prob. 21SECh. 3 - Prob. 22SECh. 3 - Prob. 23SECh. 3 - Prob. 24SECh. 3 - Arrange the...Ch. 3 - Prob. 26SECh. 3 - Prob. 27SECh. 3 - Show that if the denominations of coins arec0,c1,...Ch. 3 - Prob. 29SECh. 3 - Prob. 30SECh. 3 - Prob. 31SECh. 3 - Show that the deferred acceptance algorithm given...Ch. 3 - Prob. 33SECh. 3 - Show that when woman do the proposing in the...Ch. 3 - Prob. 35SECh. 3 - Prob. 36SECh. 3 - Prob. 37SECh. 3 - Prob. 38SECh. 3 - Prob. 39SECh. 3 - Prob. 40SECh. 3 - Prob. 41SECh. 3 - Exercises 4246 we will study the problem of load...Ch. 3 - Prob. 43SECh. 3 - Prob. 44SECh. 3 - Prob. 45SECh. 3 - Prove that the algorithm from Exercise 44 is a...Ch. 3 - Prob. 1CPCh. 3 - Prob. 2CPCh. 3 - Prob. 3CPCh. 3 - Prob. 4CPCh. 3 - Prob. 5CPCh. 3 - Prob. 6CPCh. 3 - Prob. 7CPCh. 3 - Given an integern, use the cashier’s algorithm to...Ch. 3 - Prob. 9CPCh. 3 - Prob. 10CPCh. 3 - Prob. 11CPCh. 3 - Prob. 1CAECh. 3 - Prob. 2CAECh. 3 - Using a generator of random orderings of the...Ch. 3 - Prob. 4CAECh. 3 - Write a program that animates the progress of all...Ch. 3 - Examine the history of the wordalgorithmand...Ch. 3 - Prob. 2WPCh. 3 - Explain how sorting algorithms can be classified...Ch. 3 - Prob. 4WPCh. 3 - Prob. 5WPCh. 3 - Prob. 6WPCh. 3 - Describe the historic trends in how quickly...Ch. 3 - Develop a detailed list of algorithmic paradigms...Ch. 3 - Explain what the Turing Award is and describe the...Ch. 3 - Prob. 10WPCh. 3 - Prob. 11WPCh. 3 - Describe six different NP-complete problems.Ch. 3 - Prob. 13WP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Determine the set of prices that would satisfy the condition of each the three markets using Gauss-Jordan method. Given following below in the picture.arrow_forwardIn his doctoral thesis, L. A. Beckel (University of Minnesota, 1982) studied the social behavior of river otters during the mating season. An important role in the bonding process of river otters is very short periods of social grooming. After extensive observations, Dr. Beckel found that one group of river otters under study had a frequency of initiating grooming of approximately 1.7 for each 10 minutes. Suppose that you are observing river otters for 30 minutes. Let r = 0, 1, 2, ... be a random variable that represents the number of times (in a 30-minute interval) one otter initiates social grooming of another. a) What is ?? b) Write out the formula for the probability distribution of the random variable r. P(r) = _________ c) Find the probability that one otter will initiate social grooming four or more times during the 30-minute observation period. (Round your answer to four decimal places.)arrow_forwardIn his doctoral thesis, L. A. Beckel (University of Minnesota, 1982) studied the social behavior of river otters during the mating season. An important role in the bonding process of river otters is very short periods of social grooming. After extensive observations, Dr. Beckel found that one group of river otters under study had a frequency of initiating grooming of approximately 1.7 for each 10 minutes. Suppose that you are observing river otters for 30 minutes. Let r = 0, 1, 2, ... be a random variable that represents the number of times (in a 30-minute interval) one otter initiates social grooming of another. a) Find the probabilities that in your 30 minutes of observation, one otter will initiate social grooming four times, five times, and six times. (Round your answers to four decimal places.) P(4) = P(5) = P(6) = b) Find the probability that one otter will initiate social grooming less than four times during the 30-minute observation period. (Round your answer…arrow_forward
- From time to time, the UTM Human Resource (UTMHR) department observes various employees fortheir work productivity. Recently UTMHR wanted to check whether the four employees at theDepartment XYZ counters, serve on average the same number of customers per hour. The HR managerobserved each of the four employees for a certain number of hours. The following Table 5 gives thenumber of customers served by the four employees during each of the observed hours. employee a employee b employee c employee d 19 14 11 24 21 16 14 19 26 14 21 21 24 13 13 26 18 17 16 20 employee a employee b employee c employee d mean 21.6 14.8 15.0 22.0 s 3.4 ? 3.8 ? c) Find variance between sample,d) Find variance within sample, e) Calculate the test statistic, F.f) Determine the numerator and denominator.g) Find the critical value of F at the 5% significance level, and test the claim that the mean numberof customers served per hour by each of these four employees is…arrow_forwardFrom time to time, the UTM Human Resource (UTMHR) department observes various employees fortheir work productivity. Recently UTMHR wanted to check whether the four employees at theDepartment XYZ counters, serve on average the same number of customers per hour. The HR managerobserved each of the four employees for a certain number of hours. The following Table 5 gives thenumber of customers served by the four employees during each of the observed hours. employee a employee b employee c employee d 19 14 11 24 21 16 14 19 26 14 21 21 24 13 13 26 18 17 16 20 a) Define the hypothesis null, H0 and hypothesis alternative, H1.b) Given below are means and standard deviation for some of the employees. Calculate thestandard deviation for Employee B and D.arrow_forwardA blind taste test is conducted to determine which of two colas, Brand A or Brand B, individuals prefer. Individuals are randomly asked to drink one of the two types of cola first, followed by the other cola, and then asked to disclose the drink they prefer. Results of the taste test indicate that 59 of 100 individuals prefer Brand A. Complete parts a through c.arrow_forward
- In his doctoral thesis, L. A. Beckel (University of Minnesota, 1982) studied the social behavior of river otters during the mating season. An important role in the bonding process of river otters is very short periods of social grooming. After extensive observations, Dr. Beckel found that one group of river otters under study had a frequency of initiating grooming of approximately 1.7 for each 10 minutes. Suppose that you are observing river otters for 40 minutes. Let r = 0, 1, 2, ... be a random variable that represents the number of times (in a 40-minute interval) one otter initiates social grooming of another. Lambda = 6.8 (b) Find the probabilities that in your 40 minutes of observation, one otter will initiate social grooming four times, five times, and six times. (Round your answers to four decimal places.) P(4) = P(5) = P(6) =arrow_forwardTwo samples are said to be dependent if a.the individuals in one sample are used to determine the individuals in a second sample. b.sampling for inclusion in the two samples is done with replacement. c.the individuals in one sample have no influence over the selection of the individuals in a second sample. d.some individuals, but not all, in one sample exert influence over who is selected for inclusion in a second ample.arrow_forwardAt a certain school 60 of the 100 boys and 60 of the 80 girls signed up for the senior trip. Is there an associa-tion between going on the trip and gender? A) We can’t tell, because the class doesn’t have the samenumber of boys and girls.B) Yes, because the same number of boys and girlssigned up.C) Yes, because a lower percentage of boys signed upthan of girls.D) No, because the people on the trip were 50% boysand 50% girls.E) No, because the sign-up rate was higher among girlsthan among boys.arrow_forward
- The owner of a pet store is trying to decide whether to discontinue selling specialty clothes for pets. She suspects that only 10% of the customers buy specialty clothes for their pets and thinks that she might be able to replace the clothes with more interesting and profitable items on the shelves. Before making a final decision she decides to keep track of the total number of customers for a day, and whether they purchase specialty clothes for their pet. a) Assuming the pet store owner is correct in thinking that only 10% of her customers purchase specialty clothes for their pets, how many customers should she expect before someone buys a garment for their pet? b) What is the probability that she does not sell a garment until the 5th customer? c) What is the probability that exactly 4 of the first 10 customers buy specialty clothes for their pet? d) What is the probability that at least 3 of the first 35 customers buy specialty clothes for their pet?…arrow_forwardSO what would be the L, Lq, and Wq of this problem? Assuming we are trying to develop and sovle a waiting line system that can accomodate this increased leel of passenger traffic.arrow_forwardMo. For each of the following shaded region in Figure 1, can it be the feasible region of a linear program? arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Statistics 4.1 Point Estimators; Author: Dr. Jack L. Jackson II;https://www.youtube.com/watch?v=2MrI0J8XCEE;License: Standard YouTube License, CC-BY
Statistics 101: Point Estimators; Author: Brandon Foltz;https://www.youtube.com/watch?v=4v41z3HwLaM;License: Standard YouTube License, CC-BY
Central limit theorem; Author: 365 Data Science;https://www.youtube.com/watch?v=b5xQmk9veZ4;License: Standard YouTube License, CC-BY
Point Estimate Definition & Example; Author: Prof. Essa;https://www.youtube.com/watch?v=OTVwtvQmSn0;License: Standard Youtube License
Point Estimation; Author: Vamsidhar Ambatipudi;https://www.youtube.com/watch?v=flqhlM2bZWc;License: Standard Youtube License