The iso-Score Curve Graph. A new tool for competitive bidding

The present work describes a new tool that helps bidders improve their competitive bidding strategies. This new tool consists of an easy-to-use graphical tool that allows the use of more complex decision analysis tools in the field of Competitive Bidding. The graphic tool described here tries to move away from previous bidding models which attempt to describe the result of an auction or a tender process by means of studying each possible bidder with probability density functions. As an illustration, the tool is applied to three practical cases. Theoretical and practical conclusions on the great potential breadth of application of the tool are also presented.

Designing Novel Antitrypanosomal Agents from a Mixed Graph-Theoretical Substructural Approach

Chagas disease is nowadays the most serious parasitic health problem. This disease is caused by Trypanosoma cruzi. The great number of deaths and the insufficient effectiveness of drugs against this parasite have alarmed the scientific community worldwide. In an attempt to overcome this problem, a model for the design and prediction of new antitrypanosomal agents was obtained. This used a mixed approach, containing simple descriptors based on fragments and topological substructural molecular design descriptors. A data set was made up of 188 compounds, 99 of them characterized an antitrypanosomal activity and 88 compounds that belong to other pharmaceutical categories. The model showed sensitivity, specificity and accuracy values above 85%. Quantitative fragmental contributions were also calculated. Then, and to confirm the quality of the model, 15 structures of molecules tested as antitrypanosomal compounds (that we did not include in this study) were predicted, taking into account the information on the abovementioned calculated fragmental contributions. The model showed an accuracy of 100% which means that the ""in silico"" methodology developed by our team is promising for the rational design of new antitrypanosomal drugs. (C) 2009 Wiley Periodicals, Inc. J Comput Chem 31: 882-894. 2010

Design of novel antituberculosis compounds using graph-theoretical and substructural approaches

The increasing resistance of Mycobacterium tuberculosis to the existing drugs has alarmed the worldwide scientific community. In an attempt to overcome this problem, two models for the design and prediction of new antituberculosis agents were obtained. The first used a mixed approach, containing descriptors based on fragments and the topological substructural molecular design approach (TOPS-MODE) descriptors. The other model used a combination of two-dimensional (2D) and three-dimensional (3D) descriptors. A data set of 167 compounds with great structural variability, 72 of them antituberculosis agents and 95 compounds belonging to other pharmaceutical categories, was analyzed. The first model showed sensitivity, specificity, and accuracy values above 80% and the second one showed values higher than 75% for these statistical indices. Subsequently, 12 structures of imidazoles not included in this study were designed, taking into account the two models. In both cases accuracy was 100%, showing that the methodology in silico developed by us is promising for the rational design of antituberculosis drugs.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.

Interaction and Persuasion:An analysis of the use of rhetorical devices in Gordon Brown's speech to the Labour Party Conference, on September 25, 2006

This essay has identified and analysed rhetorical devices in Gordon Brown’s speech delivered at the Labour Party conference on September 25, 2006. The aim of the study was to identify specific rhetorical devices which are described as interactional resources, analyse their uses and discuss possible effects that they may have when included in a political speech. The results are based on my own interpretations but are supported by information provided in current literature by analysts and researchers of rhetoric use. The result findings could probably serve as evidence of the need for better understanding of the devices used by politicians in their relentless endeavours to influence audience decisions.

Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem

The traveling salesman problem is although looking very simple problem but it is an important combinatorial problem. In this thesis I have tried to find the shortest distance tour in which each city is visited exactly one time and return to the starting city. I have tried to solve traveling salesman problem using multilevel graph partitioning approach.Although traveling salesman problem itself very difficult as this problem is belong to the NP-Complete problems but I have tried my best to solve this problem using multilevel graph partitioning it also belong to the NP-Complete problems. I have solved this thesis by using the k-mean partitioning algorithm which divides the problem into multiple partitions and solving each partition separately and its solution is used to improve the overall tour by applying Lin Kernighan algorithm on it. Through all this I got optimal solution which proofs that solving traveling salesman problem through graph partition scheme is good for this NP-Problem and through this we can solved this intractable problem within few minutes.Keywords: Graph Partitioning Scheme, Traveling Salesman Problem.

Creating Prestige and Global Networks through Conference Rituals

An international conference is a secular ritual which serves to create, recreate and shape global-wide translocal cultural sharings. Social anthropological theories and methods are used to show that, besides being an information flow junction, the international conference is a network crossroad and a way of socialising new members into aninternational research community. It is also capable of creating prestige and honour for the individual researcher,for the arranging research team, university and city. Rituals do not merely reflect the social relations or cosmology of a society, but are events that in themselves do important things through ritual forms and symbolic statements.

Report on IEA Task-14 activities on solar collector systems conference in Rome, 25-29 Jan. 1993

The memebers of IEA (International Energy Agency) Task 14 (Advaced Active Solar Systems) met in Rome during January 1993. The latest developments in several countries were presented and discussed during this meeting. This report describes briefly the recent work carried out on small scale systems in the Domestic Hot Water (DHW) working group of Task 14, as reported by the representatives from Canada, Denmark, Germany, Holland and Switzerland. Klaus Lorenz, SERC, attended the meeting as observer and presented our work on small-tube heat exchangers. Several participants expressed their interest. A summary of his presentation is included in this report.

Rapport från 20th European Photovoltaic Solar Energy Conference and Exhibition : Barcelona 6-10 juni 2005

På uppdrag av STEM bevakade Eva Lindberg från Centrum för solenergi-forskning, SERC, Högskolan Dalarna, 20th European Photovoltaic Solar Energy Conference and Exhibition, Barcelona, 6-10 juni 2005. Ca 1700 personer fanns på deltagarlistan. På grund av konferensen omfattning kan endast ett litet urval av föredrag och utställare kommenteras i rapporten. Konferensprogrammet var indelat på följande områden:1. Grundläggande fakta, nya komponenter och material2. Kristallina kiselsolceller and materialteknologi3. Amorft och mikrokristallint kisel4. CIS, CdTe och andra (II-VI) ternära tunnfilmsceller5. PV-moduler och komponenter i PV-system6. PV-system i nätanslutna applikationer7. Globala aspekter på PV-solelektricitet8. PV-industrins resultatFoU om kristallina solceller dominerade stort, sedan tunnfilmsceller av främst amorft kisel. Intressant var att återvinning är föremål för FoU; dels återvinning av kiselsolceller när panelen tjänat ut; dels återvinning av Cu, Cd, Se och Te när tunnfilmscellerna tas ur bruk.237 företag fanns representerade i utställningen, varav 20 från Kina. Tyskland dominerade stort. Utställningen teman var följande: 1) Tillverkare av kiselplattor, solceller, PV-moduler, koncentratorer, solföljare (se bild nedan) 2) Tillverkare och återförsäljare av utrustning och material 3) Integrering och distribution av system 4) Mätningar och kontrollteknologi 5) Forskning och laboratorier 6) Service, teknik, konsulting 7) Myndigheter och föreningar 8) Media och förlag 9) Tillverkare av inverterare 10) Övrigt.