936 resultados para logic circuits


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Includes bibliography.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Includes bibliography.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Prepared by the Massachusetts Institute of Technology, Laboratory for Insulation Research, Cambridge, Massachusetts, under USAF Contract AF 33(615)-2199."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper proposes a novel application of fuzzy logic to web data mining for two basic problems of a website: popularity and satisfaction. Popularity means that people will visit the website while satisfaction refers to the usefulness of the site. We will illustrate that the popularity of a website is a fuzzy logic problem. It is an important characteristic of a website in order to survive in Internet commerce. The satisfaction of a website is also a fuzzy logic problem that represents the degree of success in the application of information technology to the business. We propose a framework of fuzzy logic for the representation of these two problems based on web data mining techniques to fuzzify the attributes of a website.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Race is fundamental in shaping the development of Australian law just as it has played its part in other former colonies, such as the United States, where a body of critical race theory has been established on the basis of this premise. Drawing on this theory I argue that the possessive logic of patriarchal white sovereignty works ideologically to naturalise the nation as a white possession by informing and circulating a coherent set of meanings about white possession as part of common sense knowledge and socially produced conventions in the High Court's Yorta Yorta decision.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Network building and exchange of information by people within networks is crucial to the innovation process. Contrary to older models, in social networks the flow of information is noncontinuous and nonlinear. There are critical barriers to information flow that operate in a problematic manner. New models and new analytic tools are needed for these systems. This paper introduces the concept of virtual circuits and draws on recent concepts of network modelling and design to introduce a probabilistic switch theory that can be described using matrices. It can be used to model multistep information flow between people within organisational networks, to provide formal definitions of efficient and balanced networks and to describe distortion of information as it passes along human communication channels. The concept of multi-dimensional information space arises naturally from the use of matrices. The theory and the use of serial diagonal matrices have applications to organisational design and to the modelling of other systems. It is hypothesised that opinion leaders or creative individuals are more likely to emerge at information-rich nodes in networks. A mathematical definition of such nodes is developed and it does not invariably correspond with centrality as defined by early work on networks.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Objective: To compare the incidence of ventilator-associated pneumonia (VAP) in patients ventilated in intensive care by means of circuits humidified with a hygroscopic heat-and-moisture exchanger with a bacterial viral filter (HME) or hot-water humidification with a heater wire in both inspiratory and expiratory circuit limbs (DHW) or the inspiratory limb only (SHW). Design: A prospective, randomized trial. Setting: A metropolitan teaching hospital's general intensive care unit. Patients: Three hundred eighty-one patients requiring a minimum period of mechanical ventilation of 48 hrs. Interventions: Patients were randomized to humidification with use of an HME (n = 190), SHW (n = 94), or DHW (n = 97). Measurements and Main Results. Study end points were VAP diagnosed on the basis of Clinical Pulmonary Infection Score (CPIS) (1), HME resistance after 24 hrs of use, endotracheal tube resistance, and HME use per patient. VAP occurred with similar frequency in all groups (13%, HME; 14%, DHW; 10%, SHW; p = 0.61) and was predicted only by current smoking (adjusted odds ratio [AOR], 2.1; 95% confidence interval [CI], 1.1-3.9; p =.03) and ventilation days (AOR, 1.05; 95% Cl, 1.0-1.2; p =.001); VAP was less likely for patients with an admission diagnosis of pneumonia (AOR, 0.40; 95% Cl, 0.4-0.2; p =.04). HME resistance after 24 hrs of use measured at a gas flow of 50 L/min was 0.9 cm H2O (0.4-2.9). Endotracheal tube resistance was similar for all three groups (16-19 cm H2O min/L; p =.2), as were suction frequency, secretion thickness, and blood on suctioning (p =.32, p =.06, and p =.34, respectively). The HME use per patient per day was 1.13. Conclusions: Humidification technique does not influence either VAP incidence or secretion characteristics, but HMEs may have air-flow resistance higher than manufacturer specifications after 24 hrs of use.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes a logic of progress for concurrent programs. The logic is based on that of UNITY, molded to fit a sequential programming model. Integration of the two is achieved by using auxiliary variables in a systematic way that incorporates program counters into the program text. The rules for progress in UNITY are then modified to suit this new system. This modification is however subtle enough to allow the theory of Owicki and Gries to be used without change.