ppxscal/embedding_network huggingface dataset:
A Para Consistent Fuzzy Logic
Authors: Esko Turunen
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

The root of this work is in Belnap&rsquo;s four valued paraconsistent logic [2]. Based on a related study of Perny andTsoukias [11], we introduce para consistent Pavelka style fuzzysentential logic. Restricted to Lukasiewicz t&ndash;norm, ourapproach and the approach in [11] partly overlap; the maindifference lies in the interpretation of the logical connectivesimplication and negation. The essential mathematical tool proved inthis paper is a one&ndash;one correspondence between evidencecouples and evidence matrices that holds in all injectiveMV&ndash;algebras. Evidence couples associate to each formula&alpha; two values a and b that can be interpreted as the degreesof pros and cons for &alpha;, respectively. Four values t, f, k, u,interpreted as the degrees of truth, falsehood, contradiction andunknowness of &alpha;, respectively, can be calculated. In such anapproach truth and falsehood are not each others complements. Thispaper can be seen as a solution to some open problems presented in[11].
Game-Based Trust Establishment for Mobile Ad Hoc Networks
Authors: Xin Jiang, Chuang Lin, Hao Yin, Zhen Chen, Li Su
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

MANET, within which nodes can move arbitrarily, is a self-organized network without fixed infrastructure. However, due to the lack of infrastructure, limited resources and vulnerability of wireless links, security in mobile ad hoc networks is considered to be much more difficult than in traditional wired networks. Building trust relationships between each node can effectively improve the network security and performance. In this paper, basing on the game theory, we present a trust establishment scheme appropriate to the MANET environment. First, we introduce an evaluation model for trust value. Second, we analyze the computational methods of the evaluation model. Last, we propose the framework of trust establishment for MANET.
An Effective Classification Model for Cancer Diagnosis Using Micro Array Gene Expression Data
Authors: V. Saravanan, R. Mallika
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Data mining algorithms are commonly used for cancer classification. Prediction models were widely used to classify cancer cells in human body. This paper focuses on finding small number of genes that can best predict the type of cancer. From the samples taken from several groups of individuals with known classes, the group to which a new individual belongs to is determined accurately. The paper uses a classical statistical technique for gene ranking and SVM classifier for gene selection and classification. The methodology was applied on two publicly available cancer databases. SVM one-against- all and one-against-one method were used with two different kernel functions and their performances are compared and promising results were achieved.
Chaotic Signals with Weak-Structure Used for High Resolution Radar Imaging
Authors: Chen Bin, Tang Jun, Zhang Yong, Cai Peng, Huang Jian, Huang Guo Qiang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Recently, signals generated via chaotic maps for radar imaging have been studied. Chaotic signals are easy to be generated and applied, but not all chaos-based signals are suited for high resolution radar imaging. The autocorrelation and ambiguity functions of many chaos-base modulated signals are poor, so they aren't suited for radar imaging. Up to now, there has no reference to summarize which kinds of chaotic maps are fitted for high resolution radar imaging, or why they have these radar imaging properties. In this paper, we presented that chaotic maps with weak-structure, which have bigger Lyapunov exponent and bigger extending velocity, are similar to noise, and have good properties for high resolution radar imaging. We presented some chaotic maps with weak-structure, too. By simulating, It was demonstrated that, after many kinds of modulations, the autocorrelation and ambiguity functions of modulated signals generated via chaotic maps with weak-structure have good characteristic and these chaotic signals are suited for high resolution radar imaging, while those chaotic signals without weak-structure aren't.
Distributed Coordination of Autonomous Self-Organizing Agents Based on Circle-Forming
Authors: Shumin Zhou, Zhiqiang Liu, Long Gan
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The various components Sophisticated behavior can be displayed by systems composed of a large number of agents, each of which has limited intelligence and exhibits simple behaviors. How to control and coordinate this kind of agents to accomplish a prescribed task is of great interest. Aiming at exploring the self-organized behaviors of agents, this paper takes the “circle-forming” problem, one of the most important coordination problems, as the specific task assigned to a group of agents and proposes to use coordination fields as the agents’ coordination law. The simulation results show that the proposed method is simple and efficient for agents to successfully achieve their circle-forming task in a coordinated way and yield emergent and interesting behaviors among agents.
Optimizing matrix multiplication for a short-vector SIMD architecture - CELL processor
Authors: Jakub Kurzak, Wesley Alvaro, Jack Dongarra
Venue: Parallel Computing (2009)

Matrix multiplication is one of the most common numerical operations, especially in the area of dense linear algebra, where it forms the core of many important algorithms, including solvers of linear systems of equations, least square problems, and singular and eigenvalue computations. The STI CELL processor exceeds the capabilities of any other processor available today in terms of peak single precision, floating point performance, aside from special purpose accelerators like Graphics Processing Units (GPUs). In order to fully exploit the potential of the CELL processor for a wide range of numerical algorithms, fast implementation of the matrix multiplication operation is essential. The crucial component is the matrix multiplication kernel crafted for the short vector Single Instruction Multiple Data architecture of the Synergistic Processing Element of the CELL processor. In this paper, single precision matrix multiplication kernels are presented implementing the C=C-AxB^T operation and the C=C-AxB operation for matrices of size 64x64 elements. For the latter case, the performance of 25.55 Gflop/s is reported, or 99.80% of the peak, using as little as 5.9 kB of storage for code and auxiliary data structures.
Laparoscopic Virtual Mirror for Understanding Vessel Structure Evaluation Study by Twelve Surgeons
Authors: Christoph Bichlmeier, Sandro Michael Heining, Mohammad Rustaee, Nassir Navab
Venue: Proceedings of the 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality (2007)

In this paper we present the evaluation of a virtual mirror used as a navigational tool within a medical augmented reality (AR) system for laparoscopy. 12 surgeons of our clinical partner participated in an experiment to evaluate whether laparoscope augmentation extended by a virtual mirror is useful for improved perception of complex structures. Such complex structures are encountered for instance in laparoscopic resection of tumor affected liver tissue. The blood vessels supplying the tumor have to be cut and closed before tumorous tissue can be removed. A laparoscopic camera and an optical tracking system allow for the visualization of visualized medical volumetric data registered with the real anatomy. Previously injected contrast agent provides an accentuation of blood vessels within the visualization. For evaluating the suitability of a virtual mirror to support the mentioned procedure, we designed a phantom consisting of wooden branches simulating the structure of blood vessel trees. Quantitative results of the experiment show the advantage of a mirror in certain cases, when blood vessels cannot be directly seen from the camera point of view due to self-occlusion of the structure. Results of a questionnaire filled out by the surgeons after the experiments confirm the acceptance of AR technology for particular medical procedures.
Biopotential Readout Circuits for Portable Acquisition Systems, 1st edition
Authors: Refet Firat Yazicioglu, Chris Van Hoof, Robert Puers
Venue: Analog Circuits And Signal Processing (2008)

Biopotential Readout Circuits for Portable Acquisition Systemsdescribes one of the main building blocks of such miniaturized biomedical signal acquisition systems. The focus of this book is on the implementation of low-power and high-performance integrated circuit building blocks that can be used to extract biopotential signals from conventional biopotential electrodes. New instrumentation amplifier architectures are introduced and their design is described in detail. These amplifiers are used to implement complete acquisition demonstrator systems that are a stepping stone towards practical miniaturized and low-power systems.
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
Authors: Takayuki Nozaki, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Luby et al. derived evolution of degree distributions in residual graphs for irregular LDPC code ensembles. Evolution of degree distributions in residual graphs is important characteristic which is used for finite-length analysis of the expected block and bit error probability over the binary erasure channel. In this paper, we derive detailed evolution of degree distributions in residual graphs for irregular LDPC code ensembles with joint degree distributions.
Differential invariants of a Lie group action: Syzygies on a generating set
Authors: Evelyne Hubert
Venue: Journal of Symbolic Computation (2009)

Given a group action, known by its infinitesimal generators, we exhibit a complete set of syzygies on a generating set of differential invariants. For that we elaborate on the reinterpretation of Cartan's moving frame by Fels and Olver [Fels, M., Olver, P.J., 1999. Moving coframes. II. Regularization and theoretical foundations. Acta Appl. Math. 55 (2), 127-208]. This provides constructive tools for exploring algebras of differential invariants.
Fuzzy Connectedness in Interval-valued Fuzzy Topological Spaces
Authors: Hongmei Ju, Xuehai Yuan
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The aim of this paper is to introduce several types of fuzzy connectedness in interval-valued fuzzy topological spaces. This construction is based on the idea of interval-valued fuzzy set developed by Zadeh. We also investigate some interrelations between these types of fuzzy connectedness with some examples.
Monitoring and diagnosing software requirements
Authors: Yiqiao Wang, Sheila A. Mcilraith, Yijun Yu, John Mylopoulos
Venue: Automated Software Engineering (2009)

We propose a framework adapted from Artificial Intelligence theories of action and diagnosis for monitoring and diagnosing failures of software requirements. Software requirements are specified using goal models where they are associated with preconditions and postconditions. The monitoring component generates log data that contains the truth values of specified pre/post-conditions, as well as system action executions. Such data can be generated at different levels of granularity, depending on diagnostic feedback. The diagnostic component diagnoses the denial of requirements using the log data, and identifies problematic components. To support diagnostic reasoning, we transform the diagnostic problem into a propositional satisfiability (SAT) problem that can be solved by existing SAT solvers. The framework returns sound and complete diagnoses accounting for observed aberrant system behaviors. Our solution is illustrated with two medium-sized publicly available case studies: a Web-based email client and an ATM simulation. Our experimental results demonstrate the scalability of our approach.
Liskov wins Turing award
Authors: CACM Staff
Venue: Communications of the ACM (2009)

MIT's Barbara Liskov is the 55th person, and the second woman, to win the ACM A.M. Turing Award.
Fundamentals of physiological computing
Authors: Stephen H. Fairclough
Venue: Interacting with Computers (2009)

This review paper is concerned with the development of physiological computing systems that employ real-time measures of psychophysiology to communicate the psychological state of the user to an adaptive system. It is argued that physiological computing has enormous potential to innovate human-computer interaction by extending the communication bandwidth to enable the development of 'smart' technology. This paper focuses on six fundamental issues for physiological computing systems through a review and synthesis of existing literature, these are (1) the complexity of the psychophysiological inference, (2) validating the psychophysiological inference, (3) representing the psychological state of the user, (4) designing explicit and implicit system interventions, (5) defining the biocybernetic loop that controls system adaptation, and (6) ethical implications. The paper concludes that physiological computing provides opportunities to innovate HCI but complex methodological/conceptual issues must be fully tackled during the research and development phase if this nascent technology is to achieve its potential.
New gene selection method for multiclass tumor classification by class centroid
Authors: Qi Shen, Wei-min Shi, Wei Kong
Venue: Journal of Biomedical Informatics (2009)

In the analysis of gene expression profiles, the selection of genetic markers and precise diagnosis of cancer type are crucial for successful treatment. The selection of discriminatory genes is critical to improve the accuracy and decrease computational complexity and cost in microarray analysis. In this paper, we developed a new statistical parameter, the suitability score to filter genes which only utilize sample distances from the class centroid. The filtered genes are employed in the nearest centroid classification to classify cancer. To evaluate the performance of the new statistical parameter, the proposed approach is applied to three publicly available microarray datasets. In this paper we demonstrate that the proposed gene selection method is steady in handling classification tasks and is a useful tool for gene selection and mining high dimension data.
Toward Social Learning Environments
Authors: Julita Vassileva
Venue: IEEE Transactions on Learning Technologies (2008)

We are teaching a new generation of students, cradled in technologies, communication and abundance of information. The implications are that we need to focus the design of learning technologies to support social learning in context. Instead of designing technologies that &#x201C;teach&#x201D; the learner, the new social learning technologies will perform three main roles: 1) support the learner in finding the right content (right for the context, for the particular learner, for the specific purpose of the learner, right pedagogically); 2) support learners to connect with the right people (again right for the context, learner, purpose, educational goal etc.), and 3) motivate / incentivize people to learn. In the pursuit of such environments, new areas of sciences become relevant as a source of methods and techniques: social psychology, economic / game theory, multi-agent systems. The paper illustrates how social learning technologies can be designed using some existing and emerging technologies: ontologies vs. social tagging, exploratory search, collaborative vs. self-managed social recommendations, trust and reputation mechanisms, mechanism design and social visualization.
Decision on the memory size of embedded information systems in an ubiquitous maintenance environment
Authors: Hong-Bae Jun, Hyo-Won Suh
Venue: Computers and Industrial Engineering (2009)

Over the last decade, emerging information communication technologies have changed our stereotype of manufacturing and service companies. Now products equipped with embedded systems can be wirelessly networked, which leads to gathering and analyzing product status, and taking appropriate actions for maintenance operations during product lifecycle in an ubiquitous way. In this environment, it is necessary to determine the appropriate memory size of embedded systems for minimizing total maintenance system costs because the memory cost is a main cost factor for implementing the ubiquitous maintenance environment. We call it memory size decision problem in this study. We have formulated this problem with a non-linear model having constraints. The decision variable is the memory size of each embedded system. To solve this problem, we have proposed a meta heuristic search method based on genetic algorithms. To show the usefulness of the proposed heuristic, we have carried out computational experiments.
Social Context Games
Authors: Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We introduce social context games. A social context game is defined by an underlying game in strategic form, and a social context consisting of an undirected graph of neighborhood among players and aggregation functions. The players and strategies in a social context game are as in the underlying game, while the players' utilities in a social context game are computed from their payoffs in the underlying game based on the graph of neighborhood and the aggregation functions. Examples of social context games are ranking games and coalitional congestion games. In this paper we consider resource selection games as the underlying games, and four basic social contexts. An important property of resource selection games is the existence of pure strategy equilibrium. We study the existence of pure strategy Nash equilibrium in the corresponding social context games. We also show that the social context games possessing pure strategy Nash equilibria are not potential games, and therefore are distinguished from congestion games.
Low-temperature electroluminescence from an ordered nanopore array diode laser
Authors: V. B. Verma, V. C. Elarde, J. J. Coleman
Venue: Microelectronics Journal (2009)

We report the first study of spontaneous emission from an ordered nanopore array diode laser at 77K. The presence of gaps in the spontaneous emission spectrum supports the theoretically predicted formation of a subband structure in the valence and conduction bands.
Batch type local search-based adaptive neuro-fuzzy inference system (ANFIS) with self-feedbacks for time-series prediction
Authors: Catherine Vairappan, Hiroki Tamura, Shangce Gao, Zheng Tang
Venue: Neurocomputing (2009)

This paper presents an improved adaptive neuro-fuzzy inference system (ANFIS) for the application of time-series prediction. Because ANFIS is based on a feedforward network structure, it is limited to static problem and cannot effectively cope with dynamic properties such as the time-series data. To overcome this problem, an improved version of ANFIS is proposed by introducing self-feedback connections that model the temporal dependence. A batch type local search is suggested to train the proposed system. The effectiveness of the presented system is tested by using three benchmark time-series examples and comparison with the various models in time-series prediction is also shown. The results obtained from the simulation show an improved performance.
Cost-effective triple-mode reconfigurable pipeline FFT/IFFT/2-D DCT processor
Authors: Chin-Teng Lin, Yuan-Chu Yu, Lan-Da Van
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This investigation proposes a novel radix-42 algorithm with the low computational complexity of a radix-16 algorithm but the lower hardware requirement of a radix-4 algorithm. The proposed pipeline radix-42 single delay feedback path (R42SDF) architecture adopts a multiplierless radix-4 butterfly structure, based on the specific linear mapping of common factor algorithm (CFA), to support both 256-point fast Fourier transform/inverse fast Fourier transform (FFT/IFFT) and 8 × 8 2-D discrete cosine transform (DCT) modes following with the high efficient feedback shift registers architecture. The segment shift register (SSR) and overturn shift register (OSR) structure are adopted to minimize the register cost for the input reordering and post computation operations in the 8 × 8 2-D DCT mode, respectively. Moreover, the retrenched constant multiplier and eight-folded complex multiplier structures are adopted to decrease the multiplier cost and the coefficient ROM size with the complex conjugate symmetry rule and subexpression elimination technology. To further decrease the chip cost, a finite wordlength analysis is provided to indicate that the proposed architecture only requires a 13-bit internal wordlength to achieve 40-dB signal-to-noise ratio (SNR) performance in 256-point FFT/IFFT modes and high digital video (DV) compression quality in 8 × 8 2-D DCT mode. The comprehensive comparison results indicate that the proposed cost effective reconfigurable design has the smallest hardware requirement and largest hardware utilization among the tested architectures for the FFT/IFFT computation, and thus has the highest cost efficiency. The derivation and chip implementation results show that the proposed pipeline 256-point FFT/IFFT/2-D DCT triple-mode chip consumes 22.37 mW at 100 MHz at 1.2-V supply voltage in TSMC 0.13-µm CMOS process, which is very appropriate for the RSoCs IP of next-generation handheld devices.
T-S Fuzzy Control of Uncertain Nonlinear Networked Control Systems
Authors: Weihua Deng, Minrui Fei, Kang Li
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper investigates the stabilization of nonlinear networked control systems (NCSs) subject to two types of uncertainties. Firstly, the nonlinear NCS is modeled as a continuous-time Takagi-Sugeno (T-S) fuzzy system, and network-induced delays are represented using fuzzy rules which are designed by the parallel distributed compensation (PDC) technique. Then the norm-bounded uncertainty existing in model of the plant is considered, and corresponding state-feedback fuzzy controller is designed with guaranteed stability. Simulation result confirms the efficacy of the proposed fuzzy controller.
An image content description technique for the inspection of specular objects
Authors: Y. Caulier, S. Bourennane
Venue: EURASIP Journal on Advances in Signal Processing (2008)

This paper proposed an image content description method within the context of specular surface inspection. Such a method is based on a preliminary research concerning the generation of specific stripe patterns for the visual enhancement of defective surface parts of cylindrical specular objects. The goal of this paper is to address the stripe pattern interpretation within a general approach. For this purpose, different pattern recognition processes, consisting not only of the combination of different image segmentation, feature retrieval, and classification, but also of feature combination and selection, will be considered. Three top-down and one bottom-up approaches are evaluated for retrieving the most appropriate feature sets in terms of highest classification rates. It will be demonstrated that following a combination and appropriate selection of these feature sets, even better rates can be reached. With only half of the initial features, an increase of more than 2% is observable.