row number - Page 194 - Developer IT

Truly Random Numbers

German researchers use a "flip-flop" to improve random number generator Random number generation - Algorithms - Pseudorandom Numbers - Math - Recreation

Do Google's feed statistics include former users?

I'm currently not using any sort of fancy stat tracking software such as feedburner, but I occasionally look at Google's stats in their Webmaster Tools just to get a rough idea of whether the number of subscribers is going up or down. This only gives the number of users subscribed through Google products, as they explain in their help documents: Subscriber stats display the number of Google users who have subscribed to your feeds using any Google product (such as Reader, iGoogle, or Orkut). Because users can subscribe to feeds using many different aggregators or RSS readers, the actual number of subscribers to your site may be higher. I used to use Google Reader very regularly but haven't opened it in a while now. The way I understand it, this will mean that even though I haven't touched any of those feeds in a long time I'm still technically subscribed to them and will therefore be included in Google's statistic. Is this correct? Also since Google runs Feedburner, does this have any effect on their stats as well?

Read the article

How to sync audio files with Logitech media server in MAC OS?

- by Abhishek

I want to customize the Logitech Media Server (web interface on localhost) so that N number of DIFFERENT audio files will start to play at the same time on N number of wifi receivers, each file on a different receiver. Currently, the server will sync only 1 track to N number(amount) of receivers. Is it possible with Logitech media server is open source. How can I able to do this? can you explain me sample code?

Read the article

Demantra 7.3.1.3 Controlling MDP_MATRIX Combinations Assigned to Forecasting Tasks Using TargetTaskSize

- by user702295

New 7.3.1.3 parameter: TargetTaskSize Old parameter: BranchID Multiple, deprecated 7.3.1.3 onwards Parameter Location: Parameters > System Parameters > Engine > Proport Default: 0 Engine Mode: Both Details: Specifies how many MDP_MATRIX combinations the analytical engine attempts to assign to each forecasting task. Allocation will be affected by forecsat tree branch size. TaskTargetSize is automcatically calculated. It holds the perferred branch size, in number of combinations in the lowest level. This parameter is adjusted to a lower value for smaller schemas, depending on the number of available engines. - As the forecast is generated the engine goes up the tree using max_fore_level and not top_level -1. Max_fore_level has to be less than or equal to top_level -1. Due to this requirement, combinations falling under the same top level -1 member must be in the same task. A member of the top level -1 of the forecast tree is known as a branch. An engine task is therefore comprised of one or more branches. - Reveal current task size go to Engine Administrator --> View --> Branch Information and run the application on your Demantra schema. This will be deprecated in 7.3.1.3 since there is no longer a means of adjusting the brach size directly. The focus is now on proper hierarchy / forecast design. - Control of tasks The number of tasks created is the lowest of number of branches, as defined by top level -1 members in forecast tree, and engine sessions and the value of TargetTaskSize. You are used to using the branch multiplier in this calculation. As of 7.3.1.3, the branch ID multiple is deprecated. - Discovery of current branch size To resolve this you must review the 2nd highest level in the forecast tree (below highest/highest) as this is the level which determines the size of the branches. If a few resulting tasks are too large it is recommended that the forecast tree level driving branches be revised or at times completely removed from the forecast tree. - Control of foreacast tree branch size - Run the following sql to determine how even the branches are being split by the engine: select count(*),branch_id from mdp_matrix where prediction_status = 1 and do_fore = 1 group by branch_id; This will give you an understanding if some of the individual branches have an unusually large number of rows and thus might indicate that the engine is not efficiently dividing up the parallel tasks. - Based on the results of this sql, we may want to adjust the branch id multiplier and/or the number of engines (both of these settings are found in the Engine Administrator) select count(*), level_id from mdp_matrix where prediction_status = 1 and do_fore = 1 group by level_id; This will give us an understanding at which level of the Forecast tree where the forecast is being generated. Having a majority of combinations higher on the forecast tree might indicate either a poorly designed forecast tree and/or engine parameters that are too strict Based on the results of this we would adjust the Forecast Tree to see if choosing a different hierarchy might produce a forecast, with more combinations, at a lower level. For example: - Review the 2nd highest level in the forecast tree, below highest/highest, as this is the level which determines the size of the branches. - If a few resulting tasks are too large it is recommended that the forecast tree level driving branches be revised or at times completely removed from the forecast tree. - For example, if the highest level of the forecast tree is set to Brand/All Locations. - You have 10 brands but 2 of the brands account for 67% and 29% of all combinations. - There is a distinct possibility that the tasks resulting from these 2 branches will be too large for a single engine to process. Some possible solutions could be to remove the Brand level and instead use a different product grouping which has a more even distribution, possibly Product Group. - It is also possible to add a location dimension to this forecast tree level, for example Customer. This will also reduce forecast tree branch size and will deliver a balanced task allocation. - A correctly configured Forecast Tree is something that is done by the Implementation team and is not the responsibility of Oracle Support. Allocation will be affected by forecast tree branch size. When TargetTaskSize is set to 0, the default value, the system automatically calculates a value for 'TargetTaskSize' depending on the number of engines. - QUESTION: Does this mean that if TargetTaskSize is 1, we use tree branch size to allocate branches to tasks instead of automatically calculating the size? ANSWER: DEV Strongly recommends that the setting of TargetTaskSize remain at the DEFAULT of ZERO (0). - How to control the number of engines? Determine how many CPUs are on the machine(s) that is (are) running the engine. As mentioned earlier, the general rule is that you should designate 2 engines per each CPU that is available. So for example, if you are running the engine on a machine that has 4 CPU then you can have up to 8 engines designated in the Engine Administrator. In this type of architecture then instead of having one 'localhost' in your Engine Settings Screen, you would have 'localhost' repeated eight times in this field. Where do I set the number of engines? To add multiples computers where engine will run, please do a back-up of Settings.xml file under Analytical Engines\bin\ folder, then edit it and add there the selected machines. Example, this will allow 3 engines to start: - <Entry> <Key argument="ComputerNames" /> <Value type="string" argument="localhost,localhost,localhost" /> </Entry Otherwise, if there are no additional engines defined, the calculated value of 'TargetTaskSize' is used. (Oracle does not recommend changing the default value.) The TargetTaskSize holds the engines prefered branch size, in number of level 1 combinations. - Level 1 combinations, known as group size The engine manager will use this parameter to attempt creating branches with similar size. * The engine manager will not create engines that do not have a branch. The engine divider algorithm uses the value of 'TargetTaskSize' as a system-preferred branch size to create branches that are more equal in size which improves engine performance. The engine divider will try to add as many tasks as possible to an existing branch, up to the limit of 'TargetTaskSize' level 1 combinations, before adding new branches. Coming up next: - The engine divider - Group size - Level 1 combinations - MAX_FORE_LEVEL - Engine Parameters

Read the article

Music Rhythm Game Difficulty Question

- by David Dimalanta

I have curious question about music rhythm based genre while I'm making a code for the game. Is it really better if I set a random pattern encountered on every music played or there is a specific pattern depending on the music and the difficulty? I have observed the Guitar Hero 3 game for the game console where the difficulty is set on the number of strings used and possible number of combo (e.g. two-string combo). Compared to the Tap Tap Revenge for the Android and iPhone, the difficulty based on the number of BPM (Beat per Minute), meaning, number of targets spawn and must be hit.

Read the article

Attaining credit card data

- by Adam

I've read the many posts on this site that say we are not allowed to store cc numbers if we are not pci-compliant. But, I'm wondering if it is possible to send a CC number through a form to an email address? Would that be still infringing on the standards? The reason I ask is that a local business owner wants to retrieve a number through a form on his website, so he can manually enter the cc info on his end. I'm assuming the only way to properly get a credit card number is to setup a merchant account? What's the best way to get a cc number without calling the actual customer? I'm thinking email is a bad idea as well.

Read the article

Deterministic Multiplayer RTS game questions?

- by Martin K

I am working on a cross-platform multiplayer RTS game where the different clients and a server(flash and C#), all need to stay deterministically synchronised. To deal with Floatpoint inconsistencies, I've come across this method: http://joshblog.net/2007/01/30/flash-floating-point-number-errors/#comment-49912 which basically truncates off the nondeterministic part: return Math.round(1000 * float) / 1000; Howewer my concern is that every time there is a division, there is further chance of creating additional floatpoint errors, in essence making it worse? . So it occured to me, how about something like this: function floatSafe(number:Number) : Number {return Math.round(float* 1024) / 1024; } ie dividing with only powers of 2 ? What do you think? . Ironically with the above method I got less accurate results: trace( floatSafe(3/5) ) // 0.599609375 where as with the other method(dividing with 1000), or just tracing the raw value I am getting 3/5 = 0.6 or Maybe thats what 3/5 actually is, IE 0.6 cannot really be represented with a floatpoint datatype, and would be more consistent across different platforms?

Read the article

TSQL Challenge 47 - Read the modification history and identify the fir

A table contains the list of modifications made to each card. Your job is to write a query that shows the first number, current number (most recent) and the number of changes made. Join SQL Backup’s 35,000+ customers to compress and strengthen your backups "SQL Backup will be a REAL boost to any DBA lucky enough to use it." Jonathan Allen. Download a free trial now.

Read the article

Oracle SOA Suite for healthcare integration Dashboard

- by Nitesh Jain

Oracle SOA Suite Healthcare came up with a new way of monitoring where user can configure a dashboard and follow the dynamic runtime changes.Oracle SOA Suite for healthcare integration dashboards display information about the current health of the endpoints in a healthcare integration application. You can create and configure multiple dashboards as needed to monitor the status and volume metrics for the endpoints you have defined. The Dashboards reflects changes that occur in the runtime repository, such as purging runtime instance data, new messages processed, and new error messages. You can display data for various time periods, and you can manually refresh the data in real time or set the dashboard to automatically refresh at set intervals.Dashboard shows the following information: Status: The current status of the endpoint, such as Running, Idle, Disabled, or Errors. Messages Sent: The number of messages sent by the endpoint in the specified time period. Messages Received: The number of messages received by the endpoint in the specified time period. Errors: The number of messages with errors for the endpoint in the given time period. Last Sent: The date and time the last message was sent from the endpoint. Last Received: The date and time the last message was received from the endpoint. Last Error: The date and time of the last error for the endpoint. It also shows the detailed view of a specific Endpoint The document type. The number of messages received per second. The total number of message processed in the specified time period. The average size of each message.

Read the article

Finding Missing UDP Frames Using Wireshark + Custom Dissector (for CQS)

- by John Dibling

How do you use Wireshark to identify missing UDP frames? I have written a custom dissector for the CQS feed (reference page). One of our servers gaps when receiving this feed. According to Wireshark, some UDP frames are never received. I know that the frames were sent because all of our other servers are gap-free. A CQS frame consists of multiple messages, each having its own sequence number. My custom dissector provides the following data to Wireshark: cqs.frame_gaps - the number of gaps within a UDP frame (always zero) cqs.frame_first_seq - the first sequence number in a UDP frame cqs.frame_expected_seq - the first sequence number expected in the next UDP frame cqs.frame_msg_count - the number of messages in this UDP frame And I am displaying each of these values in custom columns, as shown in this screenshot: A typical CQS log will consist of millions of rows, so I can't just eyeball it. Is there any way I can get Wireshark to tell me which frames are missing?

Read the article

Getting the right results with bcp and DTS with multiple versions of SQL Server installed.

- by fatherjack

I was using SSIS for the first time on an instance the other day and came across this error when I executed a package Package migration from version 3 to version 2 failed with error 0xC001700A. The version number in the package is not valid. The version number cannot be greater than current version number. This was a pain and wasn't something that I was expecting, however, the error message made sense - the package was being executed by the wrong version of the executable. Not impossible to...(read more)

Read the article

.htaccess / 301 redirection question

- by John K

All my WordPress post URLs generate subdirectories with duplicate content and I do not know what regular expression to use to consistently 301 redirect domain.com/category/post/random-number/ to domain.com/category/post/ and domain.com/category/post/random-number/another-random-number/ also to domain.com/category/post/. Here is an example of my problem: http://www.example.com/features/harb-constitution-not-to-allow-kr-provinces-to-receive-foreign-officials/ http://www.example.com/features/harb-constitution-not-to-allow-kr-provinces-to-receive-foreign-officials/1345257927000/

Read the article

MatheMagics - Guess My Age Method 1

- by PointsToShare

© 2011 By: Dov Trietsch. All rights reserved MatheMagic – Guess My Age – Method 1 The Mathemagician stands on the stage and asks an adult to do the following: · Do the next few steps on your calculator, or the calculator in your phone, or even on a piece of paper. · Do it silently! Don’t tell me the results until I ask for them directly · Compute a single digit multiple of 9 – any one of 9, 18, 27, … all the way to 81, will do. · Now multiply your age by 10 · Subtract the 9 multiple from this number. · Tell me the result. Notice that I don’t know which multiple of 9 you subtracted from 10 times your age. I will nonetheless immediately tell you what your age is. How do I do this? Let’s do the algebra. 10X – 9Y = 10X – 10Y + Y = 10(X – Y) + Y Now remember, you asked an adult, so his/her age is a two digit number (maybe even 3 digits), thus reducing it by the single digit multiplied by nine is still positive – the lowest is can be is 100 – 81 which yields 19. Now make two numbers out of the result. The last digit and the number before it. This number is X – Y or the age minus the single digit you selected. The last digit is this very single digit. This is always so regardless of the digit you selected. So… Add tis digit to the other number and you get back the age! Q.E.D Example: I am 76 years old and here is what happens when I do the steps 76 x 10 = 760 760 – 18 = 742 made of 74 and 2. My age is 74 + 2 760 – 81 = 679 made of 67 and 9. My age is 67 + 9 A note to the socially aware mathemagician – it is safer to do it with a man. The chances of a veracious answer are much, much higher! The trick may be accomplished on any 2 or 3 digit number, not just one’s age, but if you want to know your date’s age, it’s a good way to elicit it. That’s All Folks PS for more Ageless “Age” mathemagics go to www.mgsltns.com/games.htm and also here: http://geekswithblogs.net/PointsToShare/archive/2011/11/15/mathemagics---guess-my-age---method-2.aspx

Read the article

Useful versioning scheme for a git project?

- by Oliver Weiler

I have a small github project, which I need to add an option to to output some version number on the commandline. The problem is I have no idea how to "compute" the version number. Is this some random process? Should I just start at 1.0 (probably creating a tag or something), and put a number after . for fixes? I know this question is a bit vague... I just had never to deal with this, and want to use some sane versioning scheme. EDIT Im also interested into how to update this version number automatically, maybe using something like a git hook.

Read the article

Tip: Keeping the ADF Mobile PDF Guide up to date

- by Chris Muir

This is a little tip for customers using Oracle's ADF Mobile. If you're like me, it's possible you don't rely on the online HTML version of the Mobile Developer's Guide for ADF, but rather download a PDF version of the file to use locally (look to the "PDF" link to the top right of the guide). For me the convenience of the PDF is it's faster, I can search the whole document easily, I can split read the document across two pages on my home monitor, if I lose my internet connection the document is still available, and it's easy to read on my iPad (especially on long haul flights to the US across the Pacific where there is no internet connection!). The trigger point for me to download the Oracle PDF documentation has always been on a new point release of JDeveloper. However in the case of ADF Mobile, as an extension to JDeveloper it is releasing at a much faster and independent schedule to JDeveloper and this includes updates to the documentation. As such the 11.1.2.4.0 ADF Mobile PDF guide you have locally might be out of date and you should take the opportunity to download the latest version. This is also particularly important for ADF Mobile as not only are many new features being added for each release and included in the new documentation, but the guide is under rapid improvement to clarify much of what has been written to date. Our documentation teams are super responsive to suggestions on how to improve the guides and this often shows per point release. How do you tell you've the latest guide? Look to the document part number which right now is "E24475-03". This is a unique ID per release for the document, the first part being the document number, and the part after the dash the revision number. If the website document number has a higher revision number, time to download a new up to date PDF. One last thing to share, you can follow the ADF Mobile guide document manager Brian Duffield on Twitter to keep abreast of updates. Image courtesy of Stuart Miles / FreeDigitalPhotos.net

Read the article

Numbering equations based on chapter numbers in MS-Word

- by Isaac

I am seeking for a way to number each equation based on the chapter numbers. The number should be placed at the right side of the equation and the equation should be center-aligned. Something like this: (The bounding box around 2.3 is not necessary). I found this article that do this in a tricky way. Sadly it has some problems when I use multilevel numbering for Headings. To conclude, I am looking for a way to numbers equations that: The numbering is formatted as N-M that N is chapter number and M is equation number. equation is placed in center-aligned number is placed in the right side of equation There should be a way to cross-reference each numbered equation. Thanks!

Read the article

Fast lighting with multiple lights

- by codymanix

How can I implement fast lighting with multiple lights? I don't want to restrain the player, he can place an unlimited number and possibly overlapping (point) lights into the level. The problem is that shaders which contain dynamic loops which would be necessary to calculate the lighting tend to be very slow. I had the idea that if it could be possible at compiletime to compile a shader n times where n is the number of lights. If the number n is known at compiletime, the loops can be unrolled automatically. Is this possible to generate n versions of the same shader with just a different number of lights? At runtime I could then decide which shader to use for which part of the level.

Read the article

How do I get a matching theme when I run a program as root?

- by NES

I use a Metacity theme in my Ubuntu installation. Unfortunately it isn't activated for programs with Gui that are started as root user and some other other certain programs like gufw (when i start gufw by commandline not as root)? It uses an old not very eyecandy Theme. For example for Gufw is gives the following output on commandline: /usr/share/themes/Finery/gtk-2.0/gtkrc:365: error: unexpected number `0', expected number (float) /usr/share/themes/Finery/gtk-2.0/gtkrc:365: error: unexpected number `0', expected number (float) What could be the reason, is there a way how to enable this theme also for these programs?

Read the article

Euler Problem 20

- by MarkPearl

This was probably one of the easiest ones to complete – a quick bash got me the following… The Problem n! means n (n 1) ... 3 2 1 For example, 10! = 10 9 ... 3 2 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100! The Solution private static BigInteger Factorial(int num) { if (num > 1) return (BigInteger)num * Factorial(num - 1); else return 1; } private static BigInteger SumDigits(string digits) { BigInteger result = 0; foreach (char number in digits) { result += Convert.ToInt32(number)-48; } return result; } static void Main(string[] args) { Console.WriteLine(SumDigits(Factorial(100).ToString())); Console.ReadLine(); }

Read the article

What is an easy way to see how often recently added pages are viewed in google analytics?

- by cboettig

Google Analytics makes it very easy to see the number of views of the most-viewed pages, but I cannot figure out how to see the number of views a particular page has received, or the number of views of recently added pages (e.g. blog posts). Is it possible to sort the pageviews list by date the page was added? Can this be done without having to externally create a list of recent pages and use the analytics API?

Read the article

Fast lighting with multple lights

- by codymanix

How can I implement fast lighting with multiple lights? I don't want to restrain the player, he can place an unlimited number and possibly overlapping (point) lights into the level. The problem is that shaders which contain dynamic loops which would be necessary to calculate the lighting tend to be very slow. I had the idea that if it could be possible at compiletime to compile a shader n times where n is the number of lights. If the number n is known at compiletime, the loops can be unrolled automatically. Is this possible to generate n versions of the same shader with just a different number of lights? At runtime I could then decide which shader to use for which part of the level.

Read the article

Throwing and catching exceptions in the same function/method

- by usr

I've written a function that asks a user for input until user enters a positive integer (a natural number). Somebody said I shouldn't throw and catch exceptions in my function and should let the caller of my function handle them. I wonder what other developers think about this. I'm also probably misusing exceptions in the function. Here's the code in Java: private static int sideInput() { int side = 0; String input; Scanner scanner = new Scanner(System.in); do { System.out.print("Side length: "); input = scanner.nextLine(); try { side = Integer.parseInt(input); if (side <= 0) { // probably a misuse of exceptions throw new NumberFormatException(); } } catch (NumberFormatException numFormExc) { System.out.println("Invalid input. Enter a natural number."); } } while (side <= 0); return side; } I'm interested in two things: Should I let the caller worry about exceptions? The point of the function is that it nags the user until the user enters a natural number. Is the point of the function bad? I'm not talking about UI (user not being able to get out of the loop without proper input), but about looped input with exceptions handled. Would you say the throw statement (in this case) is a misuse of exceptions? I could easily create a flag for checking validity of the number and output the warning message based on that flag. But that would add more lines to the code and I think it's perfectly readable as it is. The thing is I often write a separate input function. If user has to input a number multiple times, I create a separate function for input that handles all formatting exceptions and limitations.

Read the article

nginx errors: upstream timed out (110: Connection timed out)

- by Sparsh Gupta

Hi, I have a nginx server with 5 backend servers. We serve around 400-500 requests/second. I have started getting a large number of Upstream Timed out errors (110: Connection timed out) Error string in error.log looks like 2011/01/10 21:59:46 [error] 1153#0: *1699246778 upstream timed out (110: Connection timed out) while reading response header from upstream, client: {IP}, server: {domain}, request: "GET {URL} HTTP/1.1", upstream: "http://{backend_server}:80/{url}", host: "{domain}", referrer: "{referrer}" Any suggestions how to debug such errors. I am unable to find a munin plugin to keep a check on number of upstream errors. Sometime the number of errors per day is way too high and somedays its a more decent 3 digit number. A munin graph would probably help us finding out any pattern or correlation with anything else How can we make the number of such error as ZERO

Read the article

Looking for a dynamic programming solution

- by krammer

Given a sequence of integers in range 1 to n. Each number can appear at most once. Let there be a symbol X in the sequence which means remove the minimum element from the list. There can be an arbitrarily number of X in the sequence. Example: 1,3,4,X,5,2,X The output is 1,2. We need to find the best way to perform this operation. The solution I have been thinking is: Scan the sequence from left to right and count number of X which takes O(n) time. Perform partial sorting and find the k smallest elements (k = number of X) which takes O(n+klogk) time using median of medians. Is there a better way to solve this problem using dynamic programming or any other way ?

Read the article

Java Grade Calculator program for class kepp geting the error "Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException." [migrated]

- by user2880621

this is my first question I've posted. I've used this site to look at other questions to help with similar problems I've had. After some cursory looking I couldn't find quite the answer I was looking for so I decided to finally succumb and create an account. I am fairly new to java, only a few weeks into my first class. Anyway, my project is to create a program which takes any amount of students and their grades, and then assign them a letter grade. The catch is, however, that it is on a sort of curve and the other grades' letter are dependent on the the highest. Anything equal to or 10 points below the best grade is an a, anything 11-20 points below is a b, and so on. I am to use an array, but I get this error when ran "Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException." I will go ahead and post my code down below. Thanks for any advice you may be able to give. package grade.calculator; import java.util.Scanner; /** * * @author nichol57 */ public class GradeCalculator { /** * @param args the command line arguments */ public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.println("Enter the number of students"); int number = input.nextInt(); double[]grades = new double [number]; for (int J = number; J >=0; J--) { System.out.println("Enter the students' grades"); grades[J] = input.nextDouble(); } double best = grades[0]; for (int J = 1; J < number; J++) { if (grades[J] >= best){ best = grades[J]; } } for (int J = 0;J < number; J++){ if (grades[J] >= best - 10){ System.out.println("Student " + J + " score is " + grades[J] + " and grade is " + "A"); } else if (grades[J] >= best - 20){ System.out.println("Student " + J + " score is " + grades[J] + " and grade is " + "B"); } else if (grades[J] >= best - 30) { System.out.println("Student " + J + " score is " + grades[J] + " and grade is " + "C"); } else if (grades[J] >= best - 40) { System.out.println("Student " + J + " score is " + grades[J] + " and grade is " + "D"); } else { System.out.println("Student " + J + " score is " + grades[J] + " and grade is " + "F"); } } // end for loop for output }// end main method }

Search Results

Search found 32753 results on 1311 pages for 'row number'.

Page 194/1311 | < Previous Page | 190 191 192 193 194 195 196 197 198 199 200 201 | Next Page >

- by jjackson

- by Abhishek

- by user702295

- by David Dimalanta

- by Adam

- by Martin K

- by Nitesh Jain

- by John Dibling

- by fatherjack

- by John K

- by PointsToShare

- by Oliver Weiler

- by Chris Muir

- by Isaac

- by codymanix

- by NES

- by MarkPearl

- by cboettig

- by codymanix

- by usr

- by Sparsh Gupta

- by krammer

- by user2880621

< Previous Page | 190 191 192 193 194 195 196 197 198 199 200 201 | Next Page >