ppxscal/embedding_network huggingface dataset:
Approximate reasoning mechanism&colon; internal, external, and hybrid
Authors: Y. H. Chen
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

We suggest an input-output system point of view of the mechanism in generalized modus ponens (GMP). The antecedent and consequent in the premise are treated as an input-output pair. The other premise and the conclusion are treated as another pair. It is suggested that the two pairs are related to each other in the sense that they are generated by the same system. With the input-output system aspect, we propose to categorize the previous approximate reasoning mechanism to be either internal or external. More insights of the internal and external mechanism are explored. In addition, a new hybrid mechanism is introduced for the GMP. We suggest a way to justify that one pair is reasoned based purely on the other. This is through the comparison of the truth values of the two pairs. The hybrid mechanism preempts that the truth value of one input-output pair, which also can be viewed as a fuzzy inference, should be identical to the other. This is coined as the Principle of Equal Truth Value (PETV). Some GMP performance, which people would often expect in a realistic GMP but is never rigorously guaranteed in other mechanism, is a natural consequence of the hybrid mechanism. Another interesting result of the hybrid mechanism is that it not only indicates what can be achieved, but also what can not be done in the reasoning. This appears to be more aligned with human experience&colon; If the basis of reasoning (in the GMP, it is Premise 2) is too far away from the occurrence (i.e., Premise 1), then there is nothing one can say about the consequence (i.e., Conclusion) due to the occurrence. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The role of documents vs. queries in extracting class attributes from text
Authors: Marius Paşca, Benjamin Van Durme, Nikesh Garera
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Challenging the implicit reliance on document collections, this paper discusses the pros and cons of using query logs rather than document collections, as self-contained sources of data in textual information extraction. The differences are quantified as part of a large-scale study on extracting prominent attributes or quantifiable properties of classes (e.g., top speed, price and fuel consumption for CarModel) from unstructured text. In a head-to-head qualitative comparison, a lightweight extraction method produces class attributes that are 45% more accurate on average, when acquired from query logs rather than Web documents.
Generic discrete event simulations using D<scp>EGAS</scp>:: application to logic design and digital signal processing
Authors: Paul Pukite, Luke Ludwig
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

This paper describes a powerful Ada pattern which, when integrated with the open-source DEGAS discrete event run-time, allows a developer to write and execute logic design models in a format similar to the VHDL language. The application of this approach to other formulations, including floating-point based simulations, provides a means to establish general design, analysis, and verification strategies to a range of discrete event domains using standard Ada constructs.
No regrets: or: Edith Piaf revamps decision theory
Authors: Frank Arntzenius
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Edith Piaf is famous for her chanson "Non, je ne regrette rien". In this paper I will suggest that rational people should not violate Piaf's 'No Regrets' maxim, that is to say, I will suggest that a rational person should not be able to foresee that she will regret her decisions. A version of Piaf's maxim is the principle which says that according to any rational person the expectation value of the future desirability of an action must equal its current desirability. I call this principle Desire Reflection. I will argue that standard evidential decision theory (Jeffrey's decision theory) violates Desire Reflection. The essential reason for this violation is that evidential decision theory uses conditional probabilities in its expected utility formula, and the expectation value of future conditional probabilities does not generally equal the current conditional probability. I will next argue that standard causal decision theory (as formulated by David Lewis) does satisfy Desire Reflection. The basic reason for this is that it uses unconditional probabilities (of causal dependency hypotheses) in its expected utility formula, and it follows from van Fraassen's Belief Reflection principle that the expectation value of future unconditional probabilities equals the current unconditional probability. I then discuss a couple of variations on standard decision theories, namely Joyce's and Savage's decision theories, and argue that both satisfy Desire Reflection. However, I then point out that Savage's theory, in its barest form, is incoherent unless a constraint is added as to how to partition the states of the world into situations. I go on to propose such a constraint. I next discuss a prima facie problem for causal decision theory, namely the problem that in Newcombe type situations evidential decision theorists will, quite predictably, end up richer than causal decision theorists. In response I argue that there are also cases in which the shoe is on the other foot, and hence that this argument does not have much bite. I then, by means of Andy Egan's 'Psycho Johnny' example, turn to a more serious problem for causal decision theories, namely 'Decision Instability'. Decision Instability amounts to the problem that there are cases in which, as soon as one has made a decision, one regrets it, so that one has a violation of Piaf's maxim. I suggest dealing with this problem by allowing mixed decisions, and suggest a deliberational model (following Brian Skyrms) for handling such problems. I end by discussing how such a deliberational decision theory relates to game theory. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Prediction of wastewater treatment plant performance based on wavelet packet decomposition and neural networks
Authors: Davut Hanbay, Ibrahim Turkoglu, Yakup Demir
Venue: Expert Systems with Applications: An International Journal (2008)

In this paper, an intelligent wastewater treatment plant model is developed to predict the performance of a wastewater treatment plant (WWTP). The developed model is based on wavelet packet decomposition, entropy and neural network. The data used in this work were obtained from a WWTP in Malatya, Turkey. Daily records of these WWTP parameters over a year were obtained from the plant laboratory. Wavelet packet decomposition was used to reduce the input vectors dimensions of intelligent model. The suitable architecture of the neural network model is determined after several trial and error steps. Total suspended solid is one of the measures of overall plant performance so the developed model is used to predict the total suspended solid concentration in plant effluent. According to test results, the developed model performance is at desirable level. This model is an efficient and a robust tool to predict WWTP performance.
Modeling and simulation of grain threshing and separation in threshing units-Part I
Authors: Petre I. Miu, Heinz-Dieter Kutzbach
Venue: Computers and Electronics in Agriculture (2008)

This paper presents a comprehensive and unitary stochastic mathematical model of grain threshing and separation in both axial and tangential threshing units. The derived equations describe and quantify the percentages of unthreshed grain, free grain, and separated grain (cumulative and distribution) over the length of the threshing space, be that the rotor or the concave length. Grain threshing and separation losses are also quantified. Two coefficients of the mathematical model can be expressed as functions of functional and design parameters of the threshing unit. The model was validated with data from a large database obtained from extensive testing of various axial and tangential threshing units. Exceptional agreement of predicted and experimental data shows that all equations are highly significant.
The Road to Next-Generation Broadband
Authors: Daniel Correa
Venue: IEEE Internet Computing (2007)

Next-generation broadband promises to usher in a digital future in which it will be possible, for instance, to have a high-definition videoconference examination with your doctor from the comfort of your own home. Japan and Korea in particular are much closer to this sort of digital future than most countries, including the US. Public policy must play an important role in making tomorrow's broadband a reality in America.
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Authors: Kalyanmoy Deb
Venue: Evolutionary Computation (1999)

In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front. Identification of such features helps us develop difficult test problems for multi-objective optimization. Multi-objective test problems are constructed from single-objective optimization problems, thereby allowing known difficult features of single-objective problems (such as multi-modality, isolation, or deception) to be directly transferred to the corresponding multi-objective problem. In addition, test problems having features specific to multi-objective optimization are also constructed. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization.
Research on Fault-Tolerant Controller for Mobile Robot Based on Artificial Immune Principle
Authors: Bobo Yang, Shouwen Fan, Mingquan Shi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Imitating such biological immune system mechanisms as self-learning, memory-storing and immune- response, combined with fault tolerance design approach of redundancy and reconfiguration, an immune fault tolerance controller (IFTC) is designed and implemented in the fault tolerance control system of mobile robot. The IFTC can not only retain the good performance under normal operations but also resume desired performance when there are finite failures in system. Robustness and fault tolerance ability of the IFTC are demonstrated by simulation results, and the feasibility and efficiency of above IFTC in fault tolerance control of mobile robot are confirmed. The IFTC presented in this paper can also be applied to the design of fault tolerance control system for other electro-mechanical products.
Artificial Immunology Based Anti-Pollution P2P File Sharing System
Authors: WEI Dong, YANG Shou-bao, LIU Xiao-qian
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The problem of file pollution is prevalent in P2P file sharing system nowadays. The pollution reduces the availability of system dramatically. As the same as immune system, P2P file sharing system is also highly distributive, self-adaptive and self-organized. Artificial immunology based anti-pollution object reputation mechanism is established to select neighbor peer set and improve the system availability. Vector space similarity is computed to weight the votes collected from other peers. Horting graph-theoretic approach is employed to deal with the data sparsity problem. Selfadaptive reputation threshold scheme is adopted to estimate the file authenticity. Simulation results show that the system can distinguish between good and polluted files accurately and thwart the proliferation of pollution in the network with low communication cost.
Preliminary report on a practical type inference system for common Lisp
Authors: Randall D. Beer
Venue: ACM SIGPLAN Lisp Pointers (1987)

While the combination of dynamic typing and generic functions in Lisp have always presented a challenge to optimizing Lisp compilers for stock hardware, the situation has never been more difficult than in Common Lisp [7]. For example, one may add any of eight distinct primitive types of numbers in any combination using the single function+. While the overhead of sorting this type information out at run-time may be largely alleviated by the use of special-purpose hardware or microcode, the problem remains critical for implementations running on conventional general-purpose computers. Indeed, this situation played a crucial role in at least one wide-ranging critique of Common Lisp [2].
Analysis of stability in quadratic mean of the limit cycles of nonlinear stochastic systems
Authors: A. A. Gubkin, L. B. Ryashko
Venue: Automation and Remote Control (2007)

Consideration was given to the exponential stability in quadratic mean of the stochastically perturbed limit cycles of the nonlinear systems. An approach was developed using the spectral theory of positive operators for the stability analysis. Within the framework of this approach, a positive operator of stochastic stability is assigned to the limit cycle. The spectral radius of this operator characterizes stability of the limit cycle. An iterative numerical method was proposed for calculation of the spectral radius of the stochastic stability operator, and a theorem about its convergence was proved. The constructive potentialities of the results obtained were demonstrated by the example of bifurcational analysis of the stochastic Ressler system at transition to chaos by multiple duplication of the limit cycle period.
Some Empirical Observations on Program Behavior with Applications to Program Restructuring
Authors: J. B. Peachey
Venue: IEEE Transactions on Software Engineering (1985)

The dynamic behavior of executing programs is a significant factor in the performance of virtual memory computer systems. Program restructuring attempts to improve the behavior of programs by reorganizing their object code to account for the characteristics of the virtual memory environment. A significant component of the restructuring process involves a restructuring graph. An analysis of restructuring graphs of typical programs found edge weights to be distributed in a Bradford-Zipf fashion, implying that a large fraction of total edge weight is concentrated in relatively few edges. This empirical observation can be used to improve the clustering phase of program restructuring, by limiting consideration to edges of large weight. We consider the effect of this improved clustering in the restructuring process by examining various means of restructuring some typical programs. In our experiments, 95 percent of the total edge value is typically accounted for by 50-60 percent of the edges. For naive clustering algorithms, clustering time is therefore typically halved; for more sophisticated methods, more substantial savings result. Finally, clustering with 95 percent of total edge value typically results in only a small decay in performance measures such as number of page faults and average working set size.
Arcane Facts and New Words: Expanding Your Creative Talent
Authors: Philip Emma
Venue: IEEE Micro (2007)

In response to "constructive" e-fan mail lamenting his occasional use of "big words," columnist Phil Emma takes us on a sesquipedalian jaunt through the realm of the intellectually curious--from the Blue Note jazz club, to a chat with dizygotic Abkhaz twins at Vabj, in Bhuj, to a formal description of the Three Stooges in Backus-Naur form.
Fuzzy set based crack diagnosis system for reinforced concrete structures
Authors: Yeong Min Kim, Chee Kyeong Kim, Geon Ho Hong
Venue: Computers and Structures (2007)

This paper presents a computer assisted crack diagnosis system for reinforced concrete structures which aids the non-expert to diagnose the cause of cracks at the level of an expert in the general inspection of structures. The system presented adapts fuzzy set theory to reflect fuzzy conditions, both for crack symptoms and characteristics which are difficult to treat using crisp sets. The inputs to the system are mostly linguistic variables concerning the crack symptoms and some numeric data about concrete and environmental conditions. Using these input data and based on built-in rules, the proposed system executes fuzzy inference to evaluate the crack causes under consideration. The built-in rules were constructed by extracting expert knowledge, primarily from technical books about concrete and concrete cracks. We implemented the proposed system in a computer program with a graphic user interface for actual utilization in practical business fields. When applied to cracks actually diagnosed by experts, the proposed system provided results similar to those obtained by experts, and we expect that this system can be used as an effective crack diagnosis tool for both experts and non-experts in the regular inspection of RC structures.
Absence of inelastic collapse for a 1D gas of grains with an internal degree of freedom
Authors: Francesco Paparella, Giuseppe Passoni
Venue: Computers Mathematics with Applications (2008)

In a cooling gas of rigid particles interacting with a constant coefficient of restitution, groups of particles within the gas may experience an infinite number of collisions in a finite time. This singularity, named inelastic collapse, is a shortcoming of the mathematical model, and it hampers the efforts of simulating a freely evolving, cooling granular system. After a brief review of previous works addressing the problem, we propose a one-dimensional model where a grain is seen as a pair of point masses joined by a massless, dissipative spring. We show that binary interactions of such grains are described as impacts with a constant restitution coefficient, whose expression is given in terms of the spring parameters. However, the impact is not instantaneous, but it requires a finite time. We show that in situations that would lead to inelastic collapse, multiple interactions among grains transfer kinetic energy into potential energy associated with the deformation of the springs, rather than dissipate it. This effectively avoids the collapse. Finally, we discuss the results of the simulations of a cooling granular system in comparison with other models.
An Effective Illustrative Visualization Framework Based on Photic Extremum Lines (PELs)
Authors: Xuexiang Xie Ying He Feng Tian Hock-Soon Seah Xianfeng Gu, Hong Qin
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Conveying shape using feature lines is an important visualization tool in visual computing. The existing feature lines (e.g., ridges, valleys, silhouettes, suggestive contours, etc.) are solely determined by local geometry properties (e.g., normals and curvatures) as well as the view position. This paper is strongly inspired by the observation in human vision and perception that a sudden change in the luminance plays a critical role to faithfully represent and recover the 3D information. In particular, we adopt the edge detection techniques in image processing for 3D shape visualization and present Photic Extremum Lines (PELs) which emphasize significant variations of illumination over 3D surfaces. Comparing with the existing feature lines, PELs are more flexible and offer users more freedom to achieve desirable visualization effects. In addition, the user can easily control the shape visualization by changing the light position, the number of light sources, and choosing various light models. We compare PELs with the existing approaches and demonstrate that PEL is a flexible and effective tool to illustrate 3D surface and volume for visual computing.
Fire Risk Evaluation Model of High-Rise Buildings Based on Multilevel BP Neural Network
Authors: Dengyou Xia
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

On the basis of establishing the fire risk evaluation index system and their standard values of high-rise buildings, a multilevel BP neural network model is developed. The model can solve the problem of uncertainty, fuzziness and dynamic complexity well in the process of fire risk evaluation, which makes evaluation result more practicable and scientific. Exemplified case study has shown that the reliable evaluation result could be obtained in shorter time as long as the values of related fire risk evaluation indexes are input into the model. And the evaluation result accords with the actual situation and that of fuzzy evaluation by fire experts.
A methodology for fast and accurate yield factor estimation during global routing
Authors: Subarna Sinha, Charles C. Chiang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, a novel and computationally efficient methodology to accurately estimate key yield factors during the global routing stage is presented. Such an yield factor estimator at the global routing stage is essential since it can used to either get an early estimate of the final yield of the same design (i.e. the yield after applying the required sequence of detailed routing and post-routing yield optimizations) and/or to improve the final yield of the design by making the solution at the end of global routing more amenable to post-routing yield optimizations. The proposed yield factor estimator is inherently flexible and can easily be programmed to estimate during global routing a variety of key yield factors of the same design after a typical sequence of detailed routing and representative post-routing yield optimizations has been applied. Examples are provided to show how the yield factor estimator can be used to predict short and open critical area and metal density after typical yield optimization solutions like wire-spreading, wire-widening and metal filling, respectively. Experimental results presented in the paper show that the proposed yield factor estimator can predict final yield factor hotspots/values with a high degree of accuracy. The proposed estimator is also shown to be more suited for the purpose of yield factor estimation compared with typical metrics at the global routing stage like congestion.
Automatic cognitive load detection from speech features
Authors: Bo Yin, Natalie Ruiz, Fang Chen, M. Asif Khawaja
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Cognitive load variations have been found to impact multimodal behaviour, in particular, features of spoken input. In this paper, we present a design and implementation of a user study aimed at soliciting natural speech at three different levels of cognitive load. Some of the speech data produced was then used to train a number of models to automatically detect cognitive load. We describe a classification approach, the cognitive load levels were detected and output as discrete level ranges. The final system achieved a 71.1% accuracy for 3 levels classification in a speaker-independent setting. The ability to detect and manage a user's cognitive load can help us to adapt intelligent interfaces that ensure optimal user performance
Minimization of Exclusive or and Logical Equivalence Switching Circuits
Authors: A. Mukhopadhyay, G. Schmitz
Venue: IEEE Transactions on Computers (1970)

This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In particular, algorithms are presented for obtaining minimal modulo 2 or complement modulo 2 sum-of- products (or sums) expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables.