ppxscal/embedding_network huggingface dataset:
Message/Object Programming: An Evolutionary Change in Programming Technology
Authors: B. J. Cox
Venue: IEEE Software (1984)

Could a marriage of the message/object model, a la Smalltalk-80, and the operator/operand model, a la Unix, improve the lot of both users and programmers? Stay tuned...
Reinforced Rough Set Theory Based on Modified MEPA in Classifying Cardiovascular Disease
Authors: Ching-Hsue Cheng, Jr-Shian Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Cardiovascular disease is one of chronic diseases that seriously threaten human health. It is important that use clinical data to classify the cardiovascular diseases for supporting medical diagnosis. In this paper, we propose a new approach to reinforce rough set theory for classifying problems, which contains 3 main procedures: (1) Convert discretized continuous data into unique corresponding linguistic value; (2) use the linguistic value to extract decision rules by LEM2 (Learning from Examples Module, version 2) algorithm; and (3) utilize rule filter to improve rule quality. In empirical case study, we use a practical collected dataset, which contains 1068 patients' clinical chemistry analysis data to illustrate the proposed approach. From the results, the accuracy, coverage, and number of rules show that the proposed approach outperforms the listing rough set approach.
An Incremental On-line Parsing Algorithm for Recognizing Sketching Diagrams
Authors: J. Mas, G. Sanchez, J. Llados, B. Lamiroy
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a syntactic recognition approach for on-line drawn graphical symbols. The proposed method consists in an incremental on-line predictive parser based on symbol descriptions by an adjacency grammar. The parser analyzes input strokes as they are drawn by the user and is able to get ahead which symbols are likely to be recognized when a partial subshape is drawn in an inter- mediate state. In addition, the parser takes into account two issues. First, symbol strokes are drawn in any order by the user and second, since it is an on-line framework, the system requires real-time response. The method has been applied to an on-line sketching interface for architectural symbols.
The Properties of Priority Preservation for Different Prioritization Methods
Authors: Weijun Xu, Yucheng Dong, Maolin Hu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, the priority preservation concept for adding a new element under a criterion is proposed. Then we proved that both eigenvector prioritization method and additive normalization prioritization method are weak pri- ority preservation. In the same time, it is also proved that least deviation prioritization method, logarithmic least- squares prioritization method, least-squares prioritization method and gradient eigenvector prioritization method are strong priority preservation. The results are of importance for selecting a fitting prioritization method in the analytic hierarchy process.
Complex RTRL Neural Networks Fast Kalman Training
Authors: Pedro Henrique Gouvea Coelho, Luiz Biondi Neto
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents an Extended Fast Kalman filter training procedure for complex RTRL neural networks. Fast Kalman training methods use the framework for Extended Kalman filtering techniques which proved to be efficient but quite computationally demanding particularly when a large number of states is involved. In standard Kalman filtering algorithms the number of multiplications is proportional to the square of the number of states while in Fast Kalman algorithms that number is proportional to the number of states. Fast Kalman/Extended Kalman filter complex RTRL training algorithms inherit the convergence capabilities of the standard Extented Kalman filter techniques and are adequate for complex RTRL neural networks training involving a large number of states. Simulations were carried out which indicate the success of the method.
Speech Recognition: A Tutorial Overview
Authors: G. M. White
Venue: Computer (1976)

Research toward mechanical recognition of speech is laying the foundation for significant advances in pattern recognition and artificial intelligence. This paper explains the nature of some of these advances and provides an introduction to the state of the art of automatic speech recognition. 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
Fault Masking in Combinational Logic Circuits
Authors: F. J. O. Dias
Venue: IEEE Transactions on Computers (1975)

An important problem in fault detection is to verify whether a single-fault test set is able to detect all multiple-faults. This paper provides a solution to the above problem. It is known that a test set derived for the detection of some fault may fail this purpose in the presence of an additional fault. This phenomenon is called masking among faults, and is of great importance in the derivation of a test set which detects all multiple-faults. This paper investigates the masking relations among faults in a combinational logic circuit. For this purpose a transform for the circuit is defined and a model for fault analysis is constructed. This transform and model reduce the number of faults which have to be considered in order to achieve the detection of all multiple-faults. An algebraic procedure yields the derivation of the masking relations. A problem which arises, namely the existence of a set of faults forming a loop of masking relations is considered. An application is presented: starting with a test set derived under the single-fault assumption it is shown how to extend this test set so that it detects all multiple-faults. All of the results in this paper are valid for general multiple-output circuits. For simplicity in the exposition, the single-output case is examined.
PyTrilinos: High-performance distributed-memory solvers for Python
Authors: Marzio Sala, W. F. Spotz, M. A. Heroux
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

PyTrilinos is a collection of Python modules that are useful for serial and parallel scientific computing. This collection contains modules that cover serial and parallel dense linear algebra, serial and parallel sparse linear algebra, direct and iterative linear solution techniques, domain decomposition and multilevel preconditioners, nonlinear solvers, and continuation algorithms. Also included are a variety of related utility functions and classes, including distributed I/O, coloring algorithms, and matrix generation. PyTrilinos vector objects are integrated with the popular NumPy Python module, gathering together a variety of high-level distributed computing operations with serial vector operations. PyTrilinos is a set of interfaces to existing, compiled libraries. This hybrid framework uses Python as front-end, and efficient precompiled libraries for all computationally expensive tasks. Thus, we take advantage of both the flexibility and ease of use of Python, and the efficiency of the underlying C&plus;&plus;, C, and FORTRAN numerical kernels. Out numerical results show that, for many important problem classes, the overhead required by the Python interpreter is negligible. To run in parallel, PyTrilinos simply requires a standard Python interpreter. The fundamental MPI calls are encapsulated under an abstract layer that manages all interprocessor communications. This makes serial and parallel scripts using PyTrilinos virtually identical.
Effects of bottom electrode and environmental insulator on thermal distribution of edge contact-type PRAM cell
Authors: Minsoo Youm, Yong Tae Kim, Man Young Sung
Venue: Microelectronics Journal (2007)

Thermal characteristics of edge contact-type phase change random access memory cells have been investigated with different combinations of bottom electrode and insulator such as Ti and SiO"2, Ti and AlN, and TiN and AlN. At the same melting temperature on the programmable point of Ge"2Sb"2Te"5, we have determined heat flux for each combination: for the Ti and SiO"2, the heat flux is 3.5x10^5J/mm^2s, for the Ti and AlN, and the TiN and AlN, they are 1.7x10^6 and 1.9x10^4J/mm^2s, respectively. These simulated results mean that the combination of TiN and AlN is the most effective for the fast response of phase changing from the amorphous to the crystalline and vice versa since the TiN has lower thermal conductivity than the Ti and the AlN has higher thermal conductivity than SiO"2.
Conceptual representations between video signals and natural language descriptions
Authors: M. Arens, R. Gerber, H. -H. Nagel
Venue: Image and Vision Computing (2008)

An artificial cognitive vision system associates video signals with conceptual descriptions of the depicted time-varying scene. This linkage is mediated by knowledge representation formalisms. An experimental implementation of such an approach yielded initial results for the conceptual description of videos recorded at innercity traffic scenes, see [M. Haag, H.-H. Nagel, Incremental recognition of traffic situations from video image sequences, Image and Vision Computing 18 (2) (2000) 137-153]. Accumulating experience with this system approach and its extension for the generation of natural language texts from videos caused us to redesign the overall computer vision system as well as the knowledge representation formalisms utilised within that system.
Minimization of Fuzzy Functions
Authors: P. Siy
Venue: IEEE Transactions on Computers (1972)

It is shown that the minimum canonical sum-of-products form of a given fuzzy function is the union of all its prime implicants. A reduction rule, which is necessary and sufficient, is presented that will generate all the prime implicants.
Computation in History: Styles and Methods
Authors: D. Herlihy
Venue: Computer (1978)

Recent advances in interactive computing and file management systems help the historian fulfill his traditional function as a collector, critic, and interpreter of documents. 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
Monomial geometric programming with fuzzy relation equation constraints
Authors: Jihui Yang, Bingyuan Cao
Venue: Fuzzy Optimization and Decision Making (2007)

Monomials are widely used. They are basic structural units of geometric programming. In the process of optimization, many objective functions can be denoted by monomials. We can often see them in resource allocation and structure optimization and technology management, etc. Fuzzy relation equations are important elements of fuzzy mathematics, and they have recently been widely applied in fuzzy comprehensive evaluation and cybernetics. In view of the importance of monomial functions and fuzzy relation equations, we present a fuzzy relation geometric programming model with a monomial objective function subject to the fuzzy relation equation constraints, and develop an algorithm to find an optimal solution based on the structure of the solution set of fuzzy relation equations. Two numerical examples are given to verify the developed algorithm. Our numerical results show that the algorithm is feasible and effective.
Lateral SbTeN based multi-layer phase change memory for multi-state storage
Authors: You Yin, Hayato Sone, Sumio Hosaka
Venue: Microelectronic Engineering (2007)

X-ray diffraction patterns and resistivity measurement indicate that as-deposited N-doped Sb"2Te"3 (STN) films become amorphous while the as-deposited Sb"2Te"3 film is crystalline. A lateral as-deposited STN-based multi-layer phase change memory was proposed for multi-state storage. The active region of the device consists of a top 30-nm TiN/180-nm STN/20-nm TiN/bottom 120-nm STN stacked multi-layer. Static switching properties of the device with STN initially starting from the amorphous state exhibit two apparent S-shaped switchings, which correspond to two marked device resistance drops by a factor of 2-5. The first and second threshold voltages are around 2.8-3.2 and 4.3-5.4V, respectively. Finite element analysis of the device shows that the two switchings could sequentially occur at the electrode steps from the bottom 120-nm STN layer to the top thick 180-nm STN layer.
Addressing privacy issues in CardSpace
Authors: Waleed A. Alrodhan, Chris J. Mitchell
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

CardSpace (formerly known as InfoCard) is a Digital Identity Management system that has recently been adopted by Microsoft. In this paper we identify two security flaws in CardSpace that may lead to a serious privacy violation. The first flaw is the reliance on Internet user judgements of the trustworthiness of service providers, and the second is the reliance of the system on a single layer of authentication. We also propose a solution designed to address both flaws. Our solution is compatible with the currently deployed CardSpace identity metasystem, and should enhance the privacy of the system with minor changes to the current CardSpace framework. We also provide a security and performance analysis of the proposed solution.
Exploring term selection for geographic blind feedback
Authors: Johannes Leveling
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

Standard blind feedback techniques have been applied to geographic information retrieval (GIR) with limited success. To facilitate more geographically oriented blind feedback, this paper explores the use of meronymy (part-whole) relations for term selection, based on a meronymy predicate for selecting feedback terms.Different methods are evaluated on the German GeoCLEF 2006data, measuring standard evaluation measures such as mean average precision (MAP) or precision at five documents. To achieve a trade-off between coverage and ambiguity, a new geographic knowledge base is created, containing important place names only, which reduces ambiguity. Results indicate that blind feedback improves performance for some topics, but does not considerably change MAP in the setup. However, a higher precision at five documents is achieved if more geographically oriented term selection criteria are applied.
Personal and Hobby Computing: an Overview
Authors: J. Warren
Venue: Computer (1977)

Within the past two years, a new technical hobby has come into existence: computers. It appears that there may be in excess of 20,000 computers in not-for-profit use in homes and garages today-purchased, presumably, from the family's entertainment budget. 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
Petri Net Models for the Evaluation of Applicative Programs Based on ?-Expressions
Authors: W. E. Kluge
Venue: IEEE Transactions on Software Engineering (1983)

In applicative systems, program design is based on elementary constructs of the form apply function to argument(s), also called applications, which are to be recursively inserted into each other. Program evaluation follows a process of meaning-preserving transformations which systematically distributes argument expressions within function expressions and substitutes applications of primitive functions by their values, until a constant expression representing the result of the computation with respect to these transformations is being reached.
An Algorithm for the Solution of Linear Inequalities
Authors: G. Nagaraja
Venue: IEEE Transactions on Computers (1974)

The problem of solving a system of linear inequalities is central to pattern classification where a solution to the system, consistent or not, is required. In this paper, an algorithm is developed using the method of conjugate gradients for function minimization. Specifically, it is shown that the algorithm converges to a solution in both the consistent and inconsistent cases in a finite number of steps: this is the main result. A related criterion function which has significance in pattern classification problems is derived and a variant of the algorithm to minimize the same is given along with computationally convenient modifications. A linear minimization algorithm which makes complete use of the problem structure is given: this is a part of the main algorithm. Computer simulation results for switching problems are presented and the algorithm is compared with Ho-Kashyap and accelerated relaxation algorithms; the results show that the proposed algorithm is faster than the latter algorithms with respect to both the number of iterations and time for convergence.
On counting homomorphisms to directed acyclic graphs
Authors: Martin Dyer, Leslie Ann Goldberg, Mike Paterson
Venue: Journal of the ACM (JACM) (2007)

It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes that lie strictly between them. Thus, if P &ne; NP, it is not possible to classify NP using any finite collection of complexity classes. This situation has led to attempts to identify smaller classes of problems within NP where dichotomy results may hold: every problem is either in P or is NP-complete. A similar situation exists for counting problems. If P &ne;&num;P, there is an infinite hierarchy in between and it is important to identify subclasses of &num;P where dichotomy results hold. Graph homomorphism problems are a fertile setting in which to explore dichotomy theorems. Indeed, Feder and Vardi have shown that a dichotomy theorem for the problem of deciding whether there is a homomorphism to a fixed directed acyclic graph would resolve their long-standing dichotomy conjecture for all constraint satisfaction problems. In this article, we give a dichotomy theorem for the problem of counting homomorphisms to directed acyclic graphs. Let H be a fixed directed acyclic graph. The problem is, given an input digraph G, determine how many homomorphisms there are from G to H. We give a graph-theoretic classification, showing that for some digraphs H, the problem is in P and for the rest of the digraphs H the problem is &num;P-complete. An interesting feature of the dichotomy, which is absent from previously known dichotomy results, is that there is a rich supply of tractable graphs H with complex structure.
The Oregon Report Data-Base Systems
Authors: S. B. Yao
Venue: Computer (1978)

Data-base management is already a mature technology. The 80's will see improvements in DBMS usability, integrity, and efficiency.
Soft tissue simulation in craniofacial surgery using finite element models
Authors: U. H. Obaidellah, N. Selvanathan, Mangalam Sankupellay, Z. H. A. Hasan
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The postoperative facial soft tissue prediction is an important decisive factor for the planning in facial surgery. Realistic postoperative facial shape is significant in the craniofacial surgery. The physics based model is suitable to achieve reasonable soft tissue prediction. In this paper, we describe a framework for the computerized facial surgery simulation based on the surface based finite element modeling. In consideration of various preprocessing steps, the presented finite element models which are reconstructed from CT data are composed of quadrilateral elements. The simplified constitutive models of linear elastic models are applied in addition of various parameters representing the behavior of the facial models. Our simulation is unique for the contact analysis approach in which prediction of facial appearance is achieved through contact between the tissues involved due to the repositioning of the separated bony structure.
QoS Multicast Routing Algorithm Based on QGA
Authors: CHEN Niansheng, LI Layuan, KE Zongwu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The key problem of QoS multicast routing optimization algorithm is to build QoS constrained multicast tree. This is the most noted problem in computer networks as constrained minimum Steiner tree problem, which has also been shown as NPcomplete. Quantum genetic algorithm is a new genetic algorithm based on quantum theory. A multicast routing optimization algorithm with QoS constraints based on quantum genetic algorithm (QoSMR-QGA) is proposed in this paper, and the process of routing based on QoSMR-QGA is provided. Simulation results show that the QoSMR-QGA is the satisfied astringency and dependable rate of successful routing, to conform to the QoS multicast routing requirement of largescale network.
Evaluating the Quality of Service in Mobile Business Based on Fuzzy Set Theory
Authors: Changwoo Choi, Chulhyun Kim, Nakwhan Sung, Yongtae Park
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Today, quality of service (QoS) is reckoned as the crucial element of strategic competitiveness and the hallmark of commercial success in mobile business. In response, various approaches have been developed and applied in evaluating service quality. However, due to the intrinsic subjectivity and invisibility of customers' perception, conventional approaches are subjected to some shortcomings in measuring the mobile service quality. To address this limitation, we propose a new approach for evaluating the mobile service quality. In essence, the proposed approach is based on the fuzzy set theory. More specifically, the degree of customer's linguistic satisfaction for mobile services is gauged by triangular fuzzy number. The perceived quality is determined by multiplying the quality rating and the weight of dimensions. It is expected that the results of the proposed approach may provide more indicative and practical knowledge in evaluating the mobile service quality in mobile service.
Frequency estimation in iterative interference cancellation applied to multibeam satellite systems
Authors: J. P. Millerioux, M. L. Boucheret, C. Bazile, A. Ducasse
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

This paper deals with interference cancellation techniques to mitigate cochannel interference on the reverse link of multibeam satellite communication systems. The considered system takes as a starting point the DVB-RCS standard with the use of convolutional coding. The considered algorithm consists of an iterative parallel interference cancellation scheme which includes estimation of beamforming coefficients. This algorithm is first derived in the case of a symbol asynchronous channel with time-invariant carrier phases. The aim of this article is then to study possible extensions of this algorithm to the case of frequency offsets affecting user terminals. The two main approaches evaluated and discussed here are based on (1) the use of block processing for estimation of beamforming coefficients in order to follow carrier phase variations and (2) the use of single-user frequency offset estimations.