ppxscal/embedding_network huggingface dataset:
Quadratic forms of complex gaussian matrices and performance analysis of multiple antenna systems
Authors: Mohamed-Slim Alouini
Venue:  (2005)

Multiple-input-multiple-output (MIMO) systems employ multiple antennas at both transmitter and receiver and have been widely accepted as a major breakthrough for high-data-rate wireless communications. We present in this dissertation a novel analysis of the channel capacity and of optimum diversity combining performance of MIMO systems with finite numbers of antennas. The results in this dissertation can be classified in two categories. Firstly, we consider the channel capacity or the mutual information rate of MIMO channels. When the channel state information is known at the receiver but not at the transmitter, we derive the exact moment generating function (MGF) and moments of the mutual information (MI) with equal power transmission of multiple independent complex Gaussian codes for (i) independent but non-identically distributed (non-iid) Rician, iid Rician, and iid Rayleigh noise-limited MIMO channels, (ii) semi-correlated (either transmit or receive antennas are correlated) noise-limited MIMO channels with an arbitrary covariance matrix, (iii) MIMO Rayleigh channels in the presence of multiple colored Rayleigh interferers and noise, and (iv) MIMO Rician channels in the presence of white Rayleigh interferers. We then use the Gaussian approximation observed by Smith and Shafi and Wang and Giannakis to obtain an accurate approximation to the distribution function of the MI in the above cases. When the transmit antennas are correlated and the covariance matrix is known at the transmitter, we show that finding statistics of the MI with optimum power loading and finding the channel capacity are mathematically equivalent to the corresponding problems in the noise limited MIMO semi-correlated channels without feedback studied in case (ii). For the MIMO interference channel, we show that multiple colored Rayleigh interferers can be modeled as a single additive interferer and as such a simplified interference channel model is obtained. Secondly, we study the performance of optimum MIMO diversity combining (or beamforming) for (i) MIMO maximal-ratio-combining (MRC) over non-iid Rician fading, iid Rician fading, and semi-correlated Rayleigh fading channels, (ii) MIMO optimum combining over Rayleigh fading channels in the presence of multiple colored Rayleigh interferers and noise, and (iii) MIMO optimum combining over Rician fading channels in the presence of multiple white Rayleigh interferers. The results in this category are given in terms of the outage probability of the output signal-to-noise ratio (SNR) for MIMO MRC or the output signal-to-interference-plus-noise ratio (SINK) for MIMO optimum combining. These results also give the exact outage probability of the MI when beamforming transmission of complex Gaussian scalar codes is employed. Based on these results, the effects of the system/channel parameters on the capacity and performance are studied both analytically and numerically.
Poodle: a course-management system for mobile phones
Authors: Chris Houser, Patricia Thornton
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

Japanese mobile phones contain small but standard web browsers and email programs, and so can replace desktop computers for a variety of educational tasks. Mobile phones have the advantage of being easily usable at any time and any place, even in large lecture halls without desktop computers, and offer the possibility of exploiting time otherwise wasted in commuting. We believe that mobile phones offer our best chance at normalization: making (miniature) networked computers a standard part of every educational activity, rather than being offered only for certain activities in isolated, dedicated computer labs. A number of research projects have indeed shown the efficacy of educational applications of mobile phones, but creating such materials is still difficult. This paper proposes poodle, a coursemanagement system designed to facilitate deploying educational materials to mobile phones. After reviewing moodle, and technologies for display on small screens, this paper presents our experience with poodle, showing how it supports ubiquitous polls, quizzes, wikis, forums, and flash cards. We believe poodle is an important step towards the normalization of mobile phones in education.
Improved Text-Detection Methods for a Camera-based Text Reading System for Blind Persons
Authors: Nobuo Ezaki, Kimiyasu Kiyota, Bui Truong Minh, Marius Bulacu, Lambert Schomaker
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Automatic text recognition from natural images receives a growing attention because of potential applications in image retrieval, robotics and intelligent transport system. Camera-based document analysis becomes a real possibility with the increasing resolution and availability of digital cameras. Our research objective is a system that reads the text encountered in natural scenes with the aim to provide assistance to visually impaired persons. In the case of a blind person, finding the text region is the first important problem that must be addressed, because it cannot be assumed that the acquired image contains only characters. In a previous paper [1], we propose four textdetection methods based on connected components. Finding small characters needed significant improvement. This paper describes a new textdetection method geared for small text characters. This method uses Fisher's Discriminant Rate (FDR) to decide whether an image area should be binarized using local or global thresholds. Fusing the new method with a previous morphology-based one yields improved results. Using a controllable webcam and a laptop PC, we developed a prototype that works in real time. At first, our system tries to find in the image areas with small characters. Then it zooms into the found areas to retake higher resolution images necessary for character recognition. Going from this proof-ofconcept to a complete system requires further research effort.
Weakness and Simple Improvement of a Password Authentication Scheme Based on Geometric Approach
Authors: Wei-Chi Ku, Shen-Tien Chang, Hsi-Hung Chen, Maw-Jinn Tsaur
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In 2001, Chien et al. proposed a modified verifier-free password authentication scheme without incurring much computational overhead to improve the security of Wu's scheme. Herein, we first review Chien at al.'s scheme and then show its weakness. Furthermore, we also propose a simple improved password authentication scheme based on the geometric property of the Euclidean plane.
An Early Look at the Visualization of Three-Dimensional Tissue Growth
Authors: Belgacem Ben Youssef, Haris Widjaya
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The ability to visualize time-varying phenomena is paramount to ensure correct interpretation and analysis, provoke insights, and communicate those insights to others. In particular, interactive visualization allows us the freedom to explore the spatial and temporal domains of such phenomena. The task of visualizing tissue growth is challenging because of two factors: The amount of data that needs to be visualized and the large simulation parameter space. In this paper, we present our application of visualization to a three-dimensional simulation model for tissue growth. Cellular automata is used to model populations of cells that execute persistent random walks on the computational grid, collide, and proliferate until they reach confluence. Our research objective is the progress toward the development of a problem-solving environment that can guide the design of experiments for tissue engineers.
A Monte Carlo approach for the solution of the simple quadratic and cubic self-avoiding random walk
Authors: Buddy L. Myers, Norbert L. Enrick, Richard T. Redmond, John H. Lindgren
Venue: ACM SIGSIM Simulation Digest (1981)

A procedure for virtually memory-free Monte-Carlo simulation of the self-avoiding random walk (SAW) in a two-dimensional network and in a simple cubic lattice has been developed. It is highly efficient in yielding values of the intrachain meansquare end-to-end distance <r2n> for chains up to n = 1000 and n = 400 steps, for the two and three-dimensional cases respectively. The number <u>N</u> of walks per each chain of <u>n</u> steps involved n = 500 to N = 3000.Accessing a medium-sized computer via a portable terminal, it was possible to obtain values for <u>n</u> up to 21, with N up to 1000, in minutes, and to obtain values for <u>n</u> up to 400 and 1000 with N up to 300 in approximately an hour of computing time.The principal finding is that for <r2n> = an&gamma;, the value of the exponent remains stable at approximately 6/5, consistent with the results of prior work involving complete enumeration for <u>n</u> up to 16 and <u>n</u> up to 10 in the two-dimensional and three-dimensional cases. No comparative data are available for higher levels of <u>n</u> because of the time constraints of memory-dependent computer programs.
Strategies for Object Manipulation using Foveal and Peripheral Vision
Authors: Danica Kragic, Marten Bjorkman
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

Visual feedback is used extensively in robotics and application areas range from human-robot interaction to object grasping and manipulation. There have been a number of examples of how to develop different components required by the above applications and very few general vision systems capable of performing a variety of tasks. In this paper, we concentrate on vision strategies for robotic manipulation tasks in a domestic environment. In particular, given fetch-and-carry type of tasks, the issues related to the whole detect-approach-grasp loop are considered. We deal with the problem of flexibility and robustness by using monocular and binocular visual cues and their integration. We demonstrate real-time disparity estimation, object recognition and pose estimation. We also show how a combination of foveal and peripheral vision system can be combined in order to provide a wide, low resolution and narrow, high resolution field of view.
Detec&ccedil;&atilde;o de padr&otilde;es repetitivos em seq&uuml;&ecirc;ncias de a&ccedil;&otilde;es sobre ru&iacute;do em aplica&ccedil;&otilde;es por demonstra&ccedil;&atilde;o
Authors: Sérgio Roberto P. da Silva, Raqueline Ritter de M. Penteado
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Software applications that exploit implicit programming by demonstration should be able to detect repetitive patterns in user's actions in an autonomous and efficient way. In this paper, we present a software agent for the detection of repetitive action patterns that makes use of domain knowledge in this process. We explain its design rationale and discuss some of its advantages, by comparing it with the classic algorithm KRM, which does not make use of domain knowledge. We demonstrate that our agent might have a more efficient detection process for repetitive tasks since it activates the search algorithm fewer times. Moreover, we show that it can detect repetitive tasks even in the presence of noise in the action sequence.
Covering Transitions of Concurrent Systems through Queues
Authors: Jiale Huo, Alexandre Petrenko
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

By testing a concurrent system through queues, we seek a conclusive answer to whether a given transition of the specification of the system is executed. We define transition coverage through queues and find testing strategies to cover the transition in question with and without fairness, respectively.
Frequency-hopping based Secure Schemes in Sensornets
Authors: Jianqing Ma, Yiping Zhong, Shiyong Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Frequency-hopping is a kind of secure solution in wireless communication field. We propose two novel mechanisms based on differential frequency-hopping to prevent those attacks like jamming, eavesdropping, tampering, etc. in Wireless Sensor Networks (WSN). Also we present the deployment scheme of our secure solutions. The analysis in this paper indicates that these two solutions have a number of good properties like energy efficiency, asynchrony, robustness and effectiveness to prevent the majority attacks in WSN.
802.11 network intrusion detection using genetic programming
Authors: Patrick LaRoche, A. Nur Zincir-Heywood
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Genetic Programming (GP) based Intrusion Detection Systems (IDS) use connection state network data during their training phase. These connection states are recorded as a set of features that the GP uses to train and test solutions which allow for the efficient and accurate detection of given attack patterns. However, when applied to a 802.11 network that is faced with attacks specific to the 802.11 protocol, the GP's detection rate reduces dramatically. In this work we discuss what causes this effect, and what can be done to improve the GP's performance on 802.11 networks.
S&eacute;curisation des flux multim&eacute;dia adaptables: proposition d'un sch&eacute;ma de signature sur des proxies
Authors: Ahmed Reda Kaced, Jean Claude Moissinac
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

In this paper, we present a secured multimedia content delivery system that aims to deliver an end-to-end authenticity of original content exchanged in an heterogeneous network while allowing content adaptation by intermediary proxies between the content providers and the final users. We proposed a system prototype applicable to multimedia content meta-data written in XML, in which the signature of the documents rests on W3C XML Signature standard.
Ontology-based customizable three-dimensional modeling for simulation
Authors: Minho Park
Venue:  (2005)

Modeling techniques tend to be found in isolated communities: geometry models in computer-aided design (CAD) and computer graphics, dynamic models in computer simulation, and information models in information technology. When models are included within the same digital environment, the ways of connecting them together seamlessly and visually are not well known even though elements from each model have many commonalities. We attempt to address this deficiency by studying specific ways in which models can be interconnected within the same 3D space. For example, consider this scenario: a region with several key military vehicles and targets: planes (both fighter as well as command and control center), surface-to-air missile (SAM) sites, and drones. A variety of models define the geometry, information, and dynamics of these objects. Ideally, we can explore and execute these models within the 3D scene by formalizing domain knowledge and providing a well-defined methodology. We present a modeling and simulation methodology called integrative multimodeling. The purpose of integrative multimodeling is to provide a human-computer interaction environment that allows components of different model types to be linked to one another&mdash;most notably dynamic models used in simulation to geometry models for the phenomena being modeled. In the context of integrative multimodeling, the following general issues naturally arise: (1) &ldquo;How can we connect different model components?&rdquo;; (2) &ldquo;How can we visualize different model types in 3D space?&rdquo;; and (3) &ldquo;How can we simulate a dynamic model within the integrative multimodeling environment?&rdquo; For the first issue, we have defined a formalized scene domain to bridge semantic gaps between the different models and facilitate mapping processes between the components of the different models by conceptualizing all objects existing in the scene domain using semantic languages and tools. For the second issue, we have developed a Python-based interface to provide visualization environments. Using the interface, users can visualize and create their own model types as well as construct a model component database. For the third issue, we have employed the RUBE framework, which was developed by the Graphics, Modeling and Arts (GMA) Laboratory at the University of Florida. RUBE is an extensible markup language (XML)-based Modeling and Simulation framework and application, which permits users to specify and simulate a dynamic model, with an ability to customize a model presentation using 2D or 3D visualizations. (Abstract shortened by UMI.)
Gera&ccedil;&atilde;o de interfaces atrav&eacute;s de sistemas baseados em conhecimento: uma abordagem centrada em explica&ccedil;&otilde;es de modelos de resolu&ccedil;&atilde;o de problemas
Authors: Andréia Libório, Elizabeth Furtado, Ismael Rocha, Vasco Furtado
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

O processo de gera&ccedil;&atilde;o de interface de usu&aacute;rio &eacute; complexo e exige um grande esfor&ccedil;o do especialista porque existem v&aacute;rias combina&ccedil;&otilde;es poss&iacute;veis e incertezas sobre a mesma op&ccedil;&atilde;o. Acreditamos que &eacute; importante a modelagem dos conceitos de IHC e dos conhecimentos de todos os envolvidos e um reuso dessa modelagem para automatizar e otimizar tal processo. Portanto propomos um SBC (Sistema Baseado em Conhecimento) que represente o conhecimento dos projetistas de interface. Esse Sistema possui a caracter&iacute;stica interativa, de maneira que o usu&aacute;rio pode ter uma explica&ccedil;&atilde;o do resultado produzido melhorando o entendimento e a aceita&ccedil;&atilde;o da interface proposta. Aplicamos o m&eacute;todo proposto para gerar prot&oacute;tipos da interface do usu&aacute;rio de um sistema de simula&ccedil;&atilde;o da criminalidade.
Learning Instance Greedily Cloning Naive Bayes for Ranking
Authors: Liangxiao Jiang, Harry Zhang
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Naive Bayes (simply NB) [12] has been widely used in machine learning and data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, researchers have made a substantial amount of effort to improve naive Bayes. The related research work can be broadly divided into two approaches: eager learning and lazy learning, depending on when the major computation occurs. Different from eager approach, the key idea for extending naive Bayes from the lazy approach is to learn a naive Bayes for each testing example. In recent years, some lazy extensions of naive Bayes have been proposed. For example, SNNB [18], LWNB [7], and LBR [19]. All are aiming at improving the classification accuracy of naive Bayes. In many real-world machine learning and data mining applications, however, an accurate ranking is more desirable than an accurate classification. Responding to this fact, we present a lazy learning algorithm called instance greedily cloning naive Bayes (simply IGCNB) in this paper. Our motivation is to improve naive Bayes' ranking performance measured by AUC [4, 14]. We experimentally tested our algorithm, using the whole 36 UCI datasets recommended by Weka [1], and compared it to C4.4 [16], NB [12], SNNB [18] and LWNB [7]. The experimental results show that our algorithm outperforms all the other algorithms used to compare significantly in yielding accurate ranking.
Combining Fast Multipole Techniques and an Approximate Inverse Preconditioner for Large Electromagnetism Calculations
Authors: B. Carpentieri, I. S. Duff, L. Giraud, G. Sylvand
Venue: SIAM Journal on Scientific Computing (2005)

The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. From a linear algebra point of view, this leads to the solution of large dense complex linear systems, where the unknowns are associated with the edges of the mesh defined on the surface of the illuminated object. In this paper, we address the iterative solution of these linear systems via preconditioned Krylov solvers. Our primary focus is on the design of an efficient parallelizable preconditioner. In that respect, we consider an approximate inverse method based on the Frobenius-norm minimization. The preconditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the preconditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe how such a preconditioner can be naturally implemented in a parallel code that implements the multipole technique for the matrix-vector product calculation. We investigate the numerical scalability of our preconditioner on realistic industrial test problems and show that it exhibits some limitations on very large problems of size close to one million unknowns. To improve its robustness on those large problems we propose an embedded iterative scheme that combines nested GMRES solvers with different fast multipole computations. We show through extensive numerical experiments that this new scheme is extremely robust at affordable memory and CPU costs for the solution of very large and challenging problems.
UML Models of Agents in a Multi-Agent E-Commerce System
Authors: Costin Badica, Maria Ganzha, Marcin Paprzycki
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Recently a new model agent-based e-commerce system was proposed, in which rule-based mechanism representation was combined with lightweight modular mobile agent design. Furthermore, need for agent mobility as the optimal solution to satisfy user needs was discussed. The aim of this paper is to introduce UML formalizations of most important agents that appear in the model system as well as presentation of its complete action diagram.
Using Visualization to Understand Dependability: A Tool Support for Requirements Analysis
Authors: Paolo Donzelli, Daniel Hirschbach, Victor Basili
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Dealing with dependability requirements is a complex task for stakeholders and analysts as many different aspects of a system must be taken into account at the same time: services characteristics and quality properties, failure modes and tolerable failure rates, reactions and recovery time in case of failure, and so on. Visualization helps cope with this complexity. In this paper, we build upon a practical framework for eliciting and modeling dependability requirements to show how graphical data representation can facilitate requirements analysis during the requirements elicitation and definition process. An Air Traffic Control System, adopted as a Testbed within the NASA High Dependability Computing Project, is used as a case study.
Formatters/editors
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

I've been using a text composer from the University of British Columbia for the last six months or so, and I'm quite pleased with it. It is called FMT, and is very similar to John Ehrman's FORMAT, but is a complete rewrite (in System/360 Assembler Language not FORTRAN) and is much more powerful. Among its more interesting features are a "macro" facility something like the Generalized Markup Language in ATMS; a facility for numbering and composing footnotes; and sets of functions that can be used to generate indices and tables of contents. 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