Quick Addition of Decimals Using Reversible Conservative Logic

In recent years, reversible logic has emerged as one of the most important approaches for power optimization with its application in low power CMOS, nanotechnology and quantum computing. This research proposes quick addition of decimals (QAD) suitable for multi-digit BCD addition, using reversible conservative logic. The design makes use of reversible fault tolerant Fredkin gates only. The implementation strategy is to reduce the number of levels of delay there by increasing the speed, which is the most important factor for high speed circuits.

Automated synthesis of delay-reduced Reed-Muller universal logic module networks

This paper presents a new approach to implement Reed-Muller Universal Logic Module (RM-ULM) networks with reduced delay and hardware for synthesizing logic functions given in Reed-Muller (RM) form. Replication of single control line RM-ULM is used as the only design unit for defining any logic function. An algorithm is proposed that does exhaustive branching to reduce the number of levels and modules required to implement any logic function in RM form. This approach attains a reduction in delay, and power over other implementations of functions having large number of variables.

A simple device for the separation of weak larvae of Macrobrachium rosenbergii (De Man)

Larvae of Macrobrachium rosenbergii (De Man) are photopositive (Ling 1969a.b) and negatively rheotactic. While investigating larval diseases of M, rosenbergii it was observed that weak larvae failed to show both these responses. It was felt that this lack of response could be used to develop a device for separating the weak larvae from the apparently healthy ones. Such a device would be a valuable tool for assessing the health of a batch in terms of the percentage of 'healthy' and 'weak' larvae. What follows is a description and mode of operation of the 'photo-flow' device developed by the authors

A Classification of Sandhi Rules for Suffix Separation in Malayalam

Suffix separation plays a vital role in improving the quality of training in the Statistical Machine Translation from English into Malayalam. The morphological richness and the agglutinative nature of Malayalam make it necessary to retrieve the root word from its inflected form in the training process. The suffix separation process accomplishes this task by scrutinizing the Malayalam words and by applying sandhi rules. In this paper, various handcrafted rules designed for the suffix separation process in the English Malayalam SMT are presented. A classification of these rules is done based on the Malayalam syllable preceding the suffix in the inflected form of the word (check_letter). The suffixes beginning with the vowel sounds like ആല, ഉെെ, ഇല etc are mainly considered in this process. By examining the check_letter in a word, the suffix separation rules can be directly applied to extract the root words. The quick look up table provided in this paper can be used as a guideline in implementing suffix separation in Malayalam language

A contextual-logic extension of TOSCANA

The aim of this paper is to indicate how TOSCANA may be extended to allow graphical representations not only of concept lattices but also of concept graphs in the sense of Contextual Logic. The contextual-logic extension of TOSCANA requires the logical scaling of conceptual and relatioal scales for which we propose the Peircean Algebraic Logic as reconstructed by R. W. Burch. As graphical representations we recommend, besides labelled line diagrams of concept lattices and Sowa's diagrams of conceptual graphs, particular information maps for utilizing background knowledge as much as possible. Our considerations are illustrated by a small information system about the domestic flights in Austria.

Simultaneous Drying and Separation of Composite Agricultural Material for Hay Processing

In composite agricultural materials such as grass, tee, medicinal plants; leaves and stems have a different drying time. By this behavior, after leaving the dryer, the stems may have greater moisture content than desired, while the leaves one minor, which can cause either the appearance of fungi or the collapse of the over-dried material. Taking into account that a lot of grass is dehydrated in forced air dryers, especially rotary drum dryers, this research was developed in order to establish conditions enabling to make a separation of the components during the drying process in order to provide a homogeneous product at the end. For this, a rotary dryer consisting of three concentric cylinders and a circular sieve aligned with the more internal cylinder was proposed; so that, once material enters into the dryer in the area of the inner cylinder, stems pass through sieve to the middle and then continue towards the external cylinder, while the leaves continue by the inner cylinder. For this project, a mixture of Ryegrass and White Clover was used. The characteristics of the components of a mixture were: Drying Rate in thin layer and in rotation, Bulk density, Projected Area, Terminal velocity, weight/Area Ratio, Flux through Rotary sieve. Three drying temperatures; 40°C, 60° C and 80° C, and three rotation speeds; 10 rpm, 20 rpm and 40 rpm were evaluated. It was found that the differences in drying time are the less at 80 °C when the dryer rotates at 40 rpm. Above this speed, the material adheres to the walls of the dryer or sieve and does not flow. According to the measurements of terminal velocity of stems and leaves of the components of the mixture, the speed of the air should be less than 1.5 m s-1 in the inner drum for the leaves and less than 4.5 m s-1 in middle and outer drums for stems, in such way that only the rotational movement of the dryer moves the material and achieves a greater residence time. In other hand, the best rotary sieve separation efficiencies were achieved when the material is dry, but the results are good in all the moisture contents. The best rotary speed of sieve is within the critical rotational speed, i.e. 20 rpm. However, the rotational speed of the dryer, including the sieve in line with the inner cylinder should be 10 rpm or less in order to achieve the greatest residence times of the material inside the dryer and the best agitation through the use of lifting flights. With a finite element analysis of a dryer prototype, using an air flow allowing speeds of air already stated, I was found that the best performance occurs when, through a cover, air enters the dryer front of the Middle cylinder and when the inner cylinder is formed in its entirety through a sieve. This way, air flows in almost equal amounts by both the middle and external cylinders, while part of the air in the Middle cylinder passes through the sieve towards the inner cylinder. With this, leaves do not adhere to the sieve and flow along drier, thanks to the rotating movement of the drums and the showering caused by the lifting flights. In these conditions, the differences in drying time are reduced to 60 minutes, but the residence time is higher for the stems than for leaves, therefore the components of the mixture of grass run out of the dryer with the same desired moisture content.

Asymptotically Zero Energy Computing Using Split-Level Charge Recovery Logic

The dynamic power requirement of CMOS circuits is rapidly becoming a major concern in the design of personal information systems and large computers. In this work we present a number of new CMOS logic families, Charge Recovery Logic (CRL) as well as the much improved Split-Level Charge Recovery Logic (SCRL), within which the transfer of charge between the nodes occurs quasistatically. Operating quasistatically, these logic families have an energy dissipation that drops linearly with operating frequency, i.e., their power consumption drops quadratically with operating frequency as opposed to the linear drop of conventional CMOS. The circuit techniques in these new families rely on constructing an explicitly reversible pipelined logic gate, where the information necessary to recover the energy used to compute a value is provided by computing its logical inverse. Information necessary to uncompute the inverse is available from the subsequent inverse logic stage. We demonstrate the low energy operation of SCRL by presenting the results from the testing of the first fully quasistatic 8 x 8 multiplier chip (SCRL-1) employing SCRL circuit techniques.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

UV Embossed Plastic Chip for Protein Separation and Identification

This report demonstrates a UV-embossed polymeric chip for protein separation and identification by Capillary Isoelectric Focusing (CIEF) and Matrix Assisted Laser Desportion/Ionization Mass Spectrometry (MALDI-MS). The polymeric chip has been fabricated by UV-embossing technique with high throughput; the issues in the fabrication have been addressed. In order to achieve high sensitivity of mass detection, five different types of UV curable polymer have been used as sample support to perform protein ionization in Mass Spectrometry (MS); the best results is compared to PMMA, which was the commonly used plastic chip for biomolecular separation. Experimental results show that signal from polyester is 12 times better than that of PMMA in terms of detection sensitivity. Finally, polyester chip is utilized to carry out CIEF to separate proteins, followed by MS identification.

Sector agrícola y política de competencia

Los procesos de integración económica han puesto en evidencia que la separación tradicionalmente hecha entre las políticas comercial y de competencia no sólo es ficticia, sino que mantenerla es simplemente contradictorio con la realidad de la economía internacional. En la medida en que los mercados domésticos se han abierto al comercio internacional, se ha considerado que las políticas de competencia pueden hacerse redundantes, ya que la competencia extranjera tiende a garantizar que dichos mercados tienen un nivel adecuado de contestabilidad. Sin embargo, como se muestra en este documento para el caso del sector agrícola, en estas circunstancias, la política de competencia adquiere un nuevo e importante papel que cumplir. Acá se discute la relación general entre el sector agrícola y la política de competencia, en un contexto de relativa liberalización comercial. Se sostiene que es necesario aplicar la política de competencia al sector, ya que esto garantiza las mejores condiciones posibles para incentivar los procesos de cambio tecnológico, indispensables para desarrollar una agricultura dinámica. Igualmente, se afirma que es indispensable una aplicación rigurosa de la política de competencia que, teniendo en cuenta las particularidades de la estructura de mercado de los sectores vinculados a la agricultura hacia adelante y hacia atrás, garantice que el más competitivo sector agrícola no sea sujeto de prácticas anticompetitivas por otros agentes. Esto puede incluir la instauración de algunas excepciones puntuales para el sector, con relación a la política de competencia,