Effect of an oxide cap layer and fluorine implantation on the metal-induced lateral crystallization of amorphous silicon

In this work, we investigate the effect of oxide cap layer on the metal-induced lateral crystallization (MILC) of amorphous silicon. The MILC is characterized at temperatures in the range 550 to 428°C using Nomarski optical microscopy and Raman spectroscopy. It is shown that better lateral crystallization is obtained when the oxide cap layer is omitted, with the crystallization length increasing by 33% for a 15 hour anneal at 550°C. A smaller increase of about 10% is seen at lower temperatures between 525°C and 475°C and no increase is seen below 450°C. It is also shown that the detrimental effect of the oxide cap layer can be dramatically reduced by giving samples a fluorine implant prior to the MILC anneal. Raman spectroscopy shows that random grain growth is significantly less for unimplanted samples without an oxide cap and also for fluorine implanted samples both with and without an oxide cap. The crystallization length improvement for samples without an oxide cap layer is explained by the elimination of random grain crystallization at the interface between the amorphous silicon and the oxide cap layer

A Rule-driven Approach for Defining the Behavior of Negotiating Software Agents

One problem with existing agent-mediated negotiation systems is that they rely on ad hoc, static, non-adaptive, and hardcoded schemes to represent the behaviour of agents. This limitation is probably due to the complexity of the negotiation task itself. Indeed, while negotiating, software (human) agents face tough decisions. These decisions are based not only on the information made available by the negotiation server, but on the behaviour of the other participants in the negotiation process as well. The information and the behaviour in question are constantly changing and highly uncertain. In the first part of the paper, we propose a rule-driven approach to represent, manage and explore negotiation strategies and coordination information. For that, we divide the behaviour of negotiating agents into protocols, strategies and coordination. Among the many advantages of the proposed solution, we can cite the high level of abstraction, the closeness to human understanding, the versatility, and the possibility to modify the agents' behaviour during the negotiation process. To validate our solution, we ran many agent tournaments, and used the rule-driven approach to implement bidding strategies that are common in the English and Dutch auctions. We also implemented simple coordination schemes across several auctions. The ongoing validation work is detailed and discussed in the second part of the paper. Un des inconvénients qu'on retrouve fréquemment dans les systèmes de négociation par agents est qu'ils reposent sur des schémas ad-hoc, non adaptatifs et figés dans le code pour représenter le comportement des agents. Cette limitation est probablement due à la complexité de l'activité de négociation elle-même. En effet, au cours de la négociation, les agents logiciels (humains) ont des décisions difficiles à prendre. Ces décisions ne sont pas seulement basées sur l'information disponible sur le serveur de négociation, mais aussi sur le comportement des autres participants durant le processus de négociation. L'information et le comportement en question changent constamment et sont très incertains. Dans la première partie de l'article, nous proposons une approche à base de règles pour représenter, gérer et explorer les stratégies de négociation ainsi que l'information de coordination. Parmi les nombreux avantages de la solution proposée, on peut citer le haut niveau d'abstraction, la proximité avec la compréhension humaine, la souplesse d'utilisation et la possibilité de modifier le comportement des agents durant le processus de négociation. Pour valider notre solution, nous avons effectué plusieurs tournois entre agents et utilisé l'approche à base de règles pour implémenter des stratégies simples applicables à l'enchère anglaise et à l'enchère hollandaise. Nous avons aussi implémenté des schémas simples de coordination impliquant plusieurs enchères. Le travail de validation, en cours, est détaillé et discuté dans la seconde partie de l'article.e-negotiation, online auction, software agent, negotiation strategy, coordination, rule-based system, rule engine, Négociation électronique, enchères en ligne, agents logiciels, stratégie de négociation, coordination, système à base de règles, moteur de règles

Pembangunan Aplikasi Pelaporan Perijinan Dengan Online Analytical Processing (OLAP)

Business licensing data in a district that has been collected in a database, it will be useful when it is analyzed, so a lot of important information will be obtained. The government need a system that can help them to analyze data easily. Online Analytical Processing (OLAP) is an implementation of Data warehousing that can help reporting and analyzing well. OLAP can map the data with cube dimensions, each dimension can be easily compared, so the decision maker can find the problems that faced easily and quickly. Some of the problems that solved in this research are : Progress Report on Company Registration in several years, the Number of Companies by the type of business, Development of Investment, the number of SIUP by District, , the number of SIUP by business class, the number of license based on its type, Construction Permit (IMB) in several years, and the Number of Disorders Permits (HO) by several classification. Reporting application in data Licensing are built in this research with OLAP technology. Based on the Chi-Square testing performed for business licensing data which contain 100-1161 records, the Chi-Square value are 45,89 – 80, greater than Chi-Square table (13,28), there is significantly different for time consuming between SQL and OLAP. When data are reduced for 90 records, the Chi-Square value is 2.01, less than Chi-Square table, there is no significantly different for time consuming between SQL and OLA

Global Persistence in Directed Percolation

We consider a directed percolation process at its critical point. The probability that the deviation of the global order parameter with respect to its average has not changed its sign between 0 and t decays with t as a power law. In space dimensions d<4 the global persistence exponent theta_p that characterizes this decay is theta_p=2 while for d<4 its value is increased to first order in epsilon = 4-d. Combining a method developed by Majumdar and Sire with renormalization group techniques we compute the correction to theta_p to first order in epsilon. The global persistence exponent is found to be a new and independent exponent. We finally compare our results with existing simulations.Comment: 15 pages, LaTeX, one .eps figure include