This site uses cookies.
Some of these cookies are essential to the operation of the site,
while others help to improve your experience by providing insights into how the site is being used.
For more information, please see the ProZ.com privacy policy.
Open to considering volunteer work for registered non-profit organizations
Rates
English to Romanian - Rates: 0.06 - 0.08 EUR per word / 20 - 30 EUR per hour / 5.00 - 7.00 EUR per audio/video minute French to Romanian - Rates: 0.06 - 0.08 EUR per word / 25 - 30 EUR per hour / 5.00 - 7.00 EUR per audio/video minute Spanish to Romanian - Rates: 0.06 - 0.08 EUR per word / 20 - 30 EUR per hour / 5.00 - 7.00 EUR per audio/video minute German to Romanian - Rates: 0.07 - 0.09 EUR per word / 30 - 50 EUR per hour / 7.00 - 10.00 EUR per audio/video minute Italian to Romanian - Rates: 0.06 - 0.08 EUR per word / 20 - 30 EUR per hour
English to Italian - Rates: 0.06 - 0.08 EUR per word / 20 - 30 EUR per hour
Surcharge(s): Rush jobs +20% to +50% Handwritten source +5% to +10% Discount(s): High volume -5% to -10% Minimum charge(s): Minimum charge for translation in EUR: 5.00
Access to Blue Board comments is restricted for non-members. Click the outsourcer name to view the Blue Board record and see options for gaining access to this information.
Euro (eur), Romanian new lei (ron), U. S. dollars (usd)
Portfolio
Sample translations submitted: 1
Romanian to English: MODALITATE DE IMPLEMENTARE A REŢELELOR DE SORTARE General field: Tech/Engineering Detailed field: Computers: Systems, Networks
Source text - Romanian MODALITATE DE IMPLEMENTARE A REŢELELOR DE SORTARE
Rezumat. În această lucrare mi-am propus să elaborez un mic soft care să permită vizualizarea algoritmilor de sortare bazaţi pe un model de calcul care foloseşte o reţea de comparare, reţea în care pot fi executate simultan, adică “în paralel”, mai multe operaţii de comparare. Aplicaţia realizată se doreşte a fi utilă elevilor în momentul abordării aspectelor legate de sortare, ca o extindere la problemele analizate.
1. Introducere
Aşa cum se ştie algoritmii de sortare pentru calculatoare seriale (maşini cu acces aleator sau RAM-uri) permit execuţia doar a unei singure operaţii la un moment dat. În această lucrare voi încerca să mă ocup într-o oarecare măsura de investigarea algoritmilor de sortare bazaţi pe un model de calcul care foloseşte o reţea de comparare, reţea în care pot fi executate simultan mai multe operaţii de comparare.
Reţelele de comparare diferă de RAM-uri prin două aspecte importante. În primul rând, ele pot executa doar comparaţii. Astfel, un algoritm cum ar fi counting sort (sortarea prin numărare) nu poate fi implementat pe o reţea de comparare. În al doilea rând, dacă în cazul modelului RAM operaţiile se execută secvenţial - adică una după alta în timp - într-o reţea de comparare operaţiile pot fi executate simultan, adică “în paralel”. După cum vom vedea, această caracteristică permite realizarea unei reţele de comparare care să sorteze n valori într-un timp subliniar.
Reţeaua eficientă de sortare pe care o vom proiecta este în esenţă o versiune paralelă a algoritmului de sortare prin interclasare. Construcţia reţelei se va realiza în trei paşi având ca celulă de bază proiectarea aşa numitului algoritm de sortare bitonic. Astfel vom modifica puţin sortatorul bitonic pentru a obţine o reţea cu interclasare care poate interclasa, două secvenţe deja sortate într-o singură secvenţă sortată.
În cele din urmă vom asambla aceste reţele de interclasare într-o reţea de sortare care ştie să sorteze n valori de intrare în timpul O(log2 n).
Translation - English METHOD FOR IMPLEMENTING SORTING NETWORKS
Briefing. In this study I have planned to develop a small software program which allows the visualization of sorting algorithms based on a calculation pattern using a comparison network, a network in which can be simultaneously, namely in parallel, executed several operations of comparison. The application I created is to be useful to the students when addressing to issues related to sorting, as an extension to the analyzed problems.
1. Introduction
As it is well known, the sorting algorithms for serial computers (machines with random access or RAM memories) allow the execution only of a single operation at a given time. In this study I will try to cover to some extent the investigation of the sorting algorithms based on a calculation model that uses a comparison network, a network in which can be executed multiple comparing operations.
The comparing networks are differentiated from RAM memories through two important aspects. First, they can perform only comparisons. Thus, an algorithm such as counting sort (sorting by counting) cannot be implemented on a comparison network. Second, if in case of RAM memory model the operations can be executed sequentially - namely one after another in time - in a comparison network, the operations can be executed simultaneously, “in parallel”. As we shall see, this feature allows the realisation of a comparison network that will sort n values in a sub-linear period of time.
The efficient sorting network that we will create is essentially a parallel version of the sorting algorithm through inter-classifying. The network’s construction will be completed in three steps having as base cell the design of the so-called bitonic sorting algorithm. Thus, we will modify to some extent the bitonic sorter in order to obtain a network with inter-classifying that can inter-classify two already sorted sequences into one sorted sequence.
Finally, we will assemble these inter-classifying networks in a sorting network that can sort n input values during O time (log2 n).
Get help on technical issues / improve my technical skills
Learn more about additional services I can provide my clients
Learn more about the business side of freelancing
Stay up to date on what is happening in the language industry
Help or teach others with what I have learned over the years
Buy or learn new work-related software
Bio
Becoming a freelancer was a natural choice for me. I love the challenges that new and diverse jobs bring. I am specialized in Life Sciences, but I also translate technical documents. I love the localization of games and apps and the challenges it poses. I am treating every project with upmost seriousness and I always deliver high quality jobs.
This user has earned KudoZ points by helping other translators with PRO-level terms. Click point total(s) to see term translations provided.
Member since Sep '11
Expertise 