ppxscal/embedding_network huggingface dataset:
My agents love to conform: Norms and emotion in the micro-macro link
Authors: Christian Scheve, Daniel Moldt, Julia Fix, Rolf Luede
Venue: Computational Mathematical Organization Theory (2006)

This contribution investigates the function of emotion in relation to norms, both in natural and artificial societies. We illustrate that unintentional behavior can be normative and socially functional at the same time, thereby highlighting the role of emotion. Conceiving of norms as mental objects we then examine the role of emotion in maintaining and enforcing such propositional attitudes. The findings are subsequently related to social structural dynamics and questions concerning micro-macro linkage, in natural societies as well as in artificial systems. Finally, we outline the possibilities of an application to the socionic multi-agent architecture SONAR.
A Semantic-Based Approach to Interoperability of UML Schemas
Authors: Nadia Yaacoubi Ayadi, Yann Pollet, Mohamed Ben Ahmed
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

We address in this paper the issue of a semantic interoperability between systems relying on semantically heterogeneous models, having been designed for the purpose of independent specific goals and activities. Examples of models include ER-schema, ontologies and taxonomies. In our approach, we make explicit the semantics embedded in UML class diagrams. Towards the high expressiveness of UML constructs, we formalize their semantics in terms of a logic belonging to Description logics. However, in our opinion, Description logics's constructors are not sufficient to express contextual knowledge, we propose a reference metamodel that offers contextual primitives.
A stochastic approach to file access prediction
Authors: Jehan-François Pâris, Ahmed Amer, Darrell D. E. Long
Venue: Proceedings of the international workshop on Storage network architecture and parallel I/Os (2003)

Most existing studies of file access prediction are experimental in nature and rely on trace driven simulation to predict the performance of the schemes being investigated. We present a first order Markov analysis of file access prediction, discuss its limitations and show how it can be used to estimate the performance of file access predictors, such as First Successor, Last Successor, Stable Successor and Best-k-out-of-n. We compare these analytical results with experimental measurements performed on several file traces and find out that specific workloads, and indeed individual files, can exhibit very different levels of non-stationarity. Overall, at least 60 percent of access requests appear to remain stable over at least a month.
ANNANN - Next Steps for Scaffolding Learning About Programs
Authors: Su White, Clare Hooper, Leslie Carr, Timothy Griffith, Hugh Davis, Gary Wills
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

It is difficult for a student to learn how to program and to build an understanding of the rationale which underpins the development of a program's componentparts. Conventional tools and approaches for explaining this essentially dynamic process are limited and typically static in nature. This paper presents AnnAnn, an animated code annotator, which can be used for self study and to present code development to large groups. The technical and educational benefits of this approach are examined.
Extracting Metadata from Biological Experimental Data
Authors: Badr Al-Daihani, Alex Gray, Peter Kille
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The process of automatically extracting metadata from an experiment's dataset is an important stage in efficiently integrating this dataset with data available in public bioinformatics data sources. Metadata extracted from the experiment's dataset can be stored in databases and used to verify data extracted from other experiments' datasets. Moreover, the biologist can keep track of the dataset so that it can be easily retrieved next time. The extracted metadata can be mined to discover useful knowledge as well as integrated with other information using domain ontology to reveal hidden relationships. The experiment's dataset may contain several kinds of metadata that can be used to add semantic value to linked data. This paper describes an approach for extracting metadata from an experiment's dataset. This system has been used in a preliminary investigation of aging across species.
The Importance of the Sense of Touch in Virtual and Real Environments
Authors: Gabriel Robles-De-La-Torre
Venue: IEEE MultiMedia (2006)

What would be worse, losing your sight or your sense of touch? Although touch (more generally, somesthesis) is commonly underrated, major somesthetic loss can't be adequately compensated for by sight. It results in catastrophic impairments of hand dexterity, haptic capabilities, walking, perception of limb position, and so on. Providing users with inadequate somesthetic feedback in virtual environments might impair their performance, just as major somesthetic loss does.
How do practitioners use conceptual modeling in practice?
Authors: Islay Davies, Peter Green, Michael Rosemann, Marta Indulska, Stan Gallo
Venue: Data Knowledge Engineering (2006)

Much research has been devoted over the years to investigating and advancing the techniques and tools used by analysts when they model. As opposed to what academics, software providers and their resellers promote as should be happening, the aim of this research was to determine whether practitioners still embraced conceptual modeling seriously. In addition, what are the most popular techniques and tools used for conceptual modeling? What are the major purposes for which conceptual modeling is used? The study found that the top six most frequently used modeling techniques and methods were ER diagramming, data flow diagramming, systems flowcharting, workflow modeling, UML, and structured charts. Modeling technique use was found to decrease significantly from smaller to medium-sized organizations, but then to increase significantly in larger organizations (proxying for large, complex projects). Technique use was also found to significantly follow an inverted U-shaped curve, contrary to some prior explanations. Additionally, an important contribution of this study was the identification of the factors that uniquely influence the decision of analysts to continue to use modeling, viz., communication (using diagrams) to/from stakeholders, internal knowledge (lack of) of techniques, user expectations management, understanding models' integration into the business, and tool/software deficiencies. The highest ranked purposes for which modeling was undertaken were database design and management, business process documentation, business process improvement, and software development.
Practically Realizable Efficient Data Allocation and Replication Strategies for Distributed Databases with Buffer Constraints
Authors: Xin Gu Wujuan Lin Bharadwaj Veeravalli
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

In this paper, we address the performance of distributed database systems with buffer constraints. Specifically, our objective is to design and analyze efficient data allocation and replication strategies to minimize the total servicing cost for an arbitrary read/write request sequence, under finite buffer constraints of the nodes in the system. When the available buffer space in a node is not enough to store a copy of an object, the decision has to be made on whether or not we should evict one or more objects in use to give room for the new object copy. In this paper, we design and analyze the data replication strategies with the model of Dynamic Window Mechanism (DWM) algorithm jointly implemented with different types of object replacement strategies (No Replacement, LRU, and LFU) commonly found in practice. We consider situations wherein the object sizes are identical as well as heterogeneous. We will show the impact on the performance of the allocation and replication strategies due to the limited local database buffer capacities. We analyze and quantify theoretically (using competitive analysis) the performances of all the proposed algorithms. Further, we perform rigorous simulation experiments to validate the findings with respect to several influencing parameters. Several useful conclusions are drawn based on the experimental results and we highlight the usefulness of the algorithms under different situations.
At-Speed Testing with Timing Exceptions and Constraints-Case Studies
Authors: Dhiraj Goswami, Kun-Han Tsai, Mark Kassab, Takeo Kobayashi, Janusz Rajski, Bruce Swanson, Darryl Walters, Yasuo Sato, Toshiharu Asaka, Takashi Aikyo
Venue: Proceedings of the 15th Asian Test Symposium (2006)

In order to generate correct at-speed scan patterns, the effect of timing exceptions and constraints needs to be considered during test generation. A path-oriented approach to handle timing exception paths during atspeed ATPG has been presented in [1][2]. The new method has been applied to and tested on many example circuits at Semiconductor Technology Academic Research (STARC). This paper presents a sample of these test cases, and illustrates how the proposed method generates correct-by-construction at-speed patterns on these circuits without pessimism.
The generalized lapped transform (GLT) for subband coding applications
Authors: S. C. Chan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper proposes a new family of perfect reconstruction (PR) linear phase filter banks called the generalized lapped transform (GLT). The GLT differs from the traditional lapped orthogonal transform (LOT) in that it is nonorthogonal and hence offers more freedom to avoid blocking effects and improve the coding gain. Since the GLT can also be viewed as a generalization of the traditional discrete cosine transform (DCT), fast algorithms for their implementation are also available.
Correlation Statistics for cDNA Microarray Image Analysis
Authors: Radhakrishnan Nagarajan, Meenakshi Upreti
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2006)

In this paper, correlation of the pixels comprising a microarray spot is investigated. Subsequently, correlation statistics, namely, Pearson correlation and Spearman rank correlation, are used to segment the foreground and background intensity of microarray spots. The performance of correlation-based segmentation is compared to clustering-based (PAM, k-means) and seeded-region growing techniques (SPOT). It is shown that correlation-based segmentation is useful in flagging poorly hybridized spots, thus minimizing false-positives. The present study also raises the intriguing question of whether a change in correlation can be an indicator of differential gene expression.
Improved Precision of Coarse Grained Localization in Wireless Sensor Networks
Authors: Frank Reichenbach, Jan Blumenthal, Dirk Timmermann
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

In wireless sensor networks, the coarse grained localization is a method to compute the position of randomly distributed sensor nodes. Without optimizations, it provides low precision which heavily depends on the transmission range of base stations. In this paper, we propose novel optimizations of Coarse Grained Localization with Centroid Determination (CGLCD) to determine the position of nodes more precisely. Our focus is to compute an optimal transmission range of all base stations and to reduce the total energy consumption. We present an analytic proof of a simple equation to determine the optimal transmission range in grid-aligned finite wireless sensor networks. Using this optimal transmission range, we reduced the positioning error about 80%. Thereby, nodes as well as base stations require lowest energy.
Seamless Real-time Clinical Data Integration for Mobile Clinical Information System
Authors: Jinwook Choi, Sooyoung Yoo, Heekyong Park, Jonghoon Chun
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

The main obstacles for adopting a mobile health information system are the redundancy of clinical data and the additional workload for implementing the new system. To obtain a seamless communication and to reduce the workload of implementation, an easy and simple implementation strategy is required. We propose a mobile clinical information system (MobileMed) which is specially designed for the easy implementation. The key elements of MobileMed are a smart interface, an HL7 message server, a central clinical database (CCDB), and a web server. The smart interface module transfers the key information to the HL7 message server as new clinical tests data is recorded in the laboratory information system. The HL7 message server generates the HL7 messages and sends them to the CCDB. As a central database the CCDB collects the HL7 messages and presents them to the various mobile devices. Through this study we might conclude that the architecture for the mobile system will be efficient for real-time data communication, and the specially designed interface will be an easy tool for implementing the mobile clinical information system.
Optimally Karhunen-Loeve-like STFT expansion of nonstationary processes
Authors: W. Kozek
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

To any nonstationary process, characterized by its correlation function, there corresponds an optimal window such that the short-time Fourier transform (STFT) coefficients are minimally correlated. The author makes this statement precise and derives a compact window optimization criterion in terms of the ambiguity function of the window and the expected ambiguity function of the process. As an application, he proposes a two-step procedure for time-varying spectral estimation: (I) window optimization based on an estimate of the expected ambiguity function, and (II) a spectrogram using the optimized window. An iterative algorithm is presented for the discrete-time window optimization, and experimental results are shown. 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
NLSOFT: an interactive graphical software for designing nonlinear controllers
Authors: A. Kaddouri, S. Blais, M. Ghribi, O. Akhrif
Venue: Mathematics and Computers in Simulation (2006)

This paper describes new software called NLSoft, developed for the design of nonlinear controllers based on the well-known feedback linearization technique. NLSoft is a software package containing several symbolic manipulation modules, which includes differential geometric tools for the design and simulation of control systems. NLSoft presents a user-friendly graphical user interface (GUI) as well as a new and powerful module permitting the calculation time of linearizing control laws considering several digital signal processors (DSPs) characteristics. These facilitate the real-time implementation of the control system. NLSoft is validated considering a six order dynamic nonlinear system.
Waterloo microSYSTEMS
Authors: Terry Wilkinson
Venue: ACM SIGSMALL Newsletter (1982)

As most of our readers know, the University of Waterloo has been involved for many years in the development of computer software. The main emphasis has always been on enhancing the learning environment by developing systems to meet our specific needs. 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
Mining Plausible Patterns from Genomic Data
Authors: Jiri Klema, Arnaud Soulet, Bruno Cremilleux, Sylvain Blachon, Olivier Gandrillon
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The discovery of biologically interpretable knowledge from gene expression data is one of the largest contemporary genomic challenges. As large volumes of expression data are being generated, there is a great need for automated tools that provide the means to analyze them. However, the same tools can provide an overwhelming number of candidate hypotheses which can hardly be manually exploited by an expert. An additional knowledge helping to focus automatically on the most plausible candidates only can up-value the experiment significantly. Background knowledge available in literature databases, biological ontologies and other sources can be used for this purpose. In this paper we propose and verify a methodology that enables to effectively mine and represent meaningful over-expression patterns. Each pattern represents a bi-set of a gene group over-expressed in a set of biological situations. The originality of the framework consists in its constraint-based nature and an effective cross-fertilization of constraints based on expression data and background knowledge. The result is a limited set of candidate patterns that are most likely interpretable by biologists. Supplemental automatic interpretations serve to ease this process. Various constraints can generate plausible pattern sets of different characteristics.
Formal Analysis and Verification of an OFDM Modem Design using HOL
Authors: Abu Nasser M. Abdullah, Behzad Akbarpour, Sofiene Tahar
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

In this paper we formally specify and verify an implementation of the IEEE802.11a standard physical layer based OFDM (Orthogonal Frequency Division Multiplexing) modem using the HOL (Higher Order Logic) theorem prover. The versatile expressive power of HOL helped model the original design at all abstraction levels starting from a floating-point model to the fixed-point design and then synthesized and implemented in FPGA technology. The paper also investigates the rounding error accumulated during ideal real to floating-point and fixedpoint transitions at the algorithmic level.
A method of visual metrology from uncalibrated images
Authors: Zezhi Chen, Nick Pears, Bojian Liang
Venue: Pattern Recognition Letters (2006)

A method of measuring the height of any feature above a reference plane from a pair of uncalibrated images, separated by a (near) pure translation is presented. The output of the algorithm is a feature height, expressed as a fraction of the height of the camera above the reference plane. There are three contributions. Firstly a robust method of computing the dual epipole or focus of expansion (FOE) under pure translation is presented. Secondly, a novel reciprocal-polar (RP) image rectification scheme is presented, which allows planar image motion, expressed as a planar homography, to be accurately detected and recovered by 1D correlation. The technique can work even when there are no corner features on the reference plane and even over large image distortions caused by large camera motion, which would cause correlation techniques in the original image space to fail. Thirdly, we present a projective construct to enable measurement of the relative (or affine) feature height. Results show that our algorithm performs very well against outliers and noise. The mean of absolute error is 1.8mm, and the mean of relative error is only 0.13% with two outliers removed.
Algorithmic CyberFilm Language
Authors: Yutaka Watanobe, Nikolay N. Mirenkov, Rentaro Yoshioka
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

The algorithmic cyberFilm language is a visual programming language for presentation, specification and consequent automatic code generation of computational algorithms. The language employs a physical-mathematical abstraction which represents an algorithm as a model of a space and activity in this space. This language has been used to present/specify a variety of algorithms, but a general description of it has not yet been presented. This paper provides an additional description of the algorithmic cyberFilm language including its syntax and semantic aspects. We also show that certain constructs of this language represent semantic features of other constructs.
On uncontrollable non-linear dynamic systems: analytic solutions for integral manifolds
Authors: J. D. Stefanovski, G. M. Dimirovski
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

In this paper three solutions for invariant submanifolds of nonlinear control systems are presented. The first and the second are based on functional expansion, which can be obtained by differentiation of functions only. The third one presents a singular solution and is based on linear-algebraic operations and finite differentiation of functions only. Examples for all derived results are presented.
Interactive Image Registration as a Positioning Verification Tool for Radiation Treatment Planning
Authors: Ti-Cheng Lu, Ching-Fen Jiang, Shuh-Ping Sun, Ching-Jung Wu
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The paper presents the development of a computeraided image registration tool (CAIMT) for system setup verification in radiation treatment planning. Image registration was achieved by application of Generalized Hough Transform (GHT) to match the detected skull contours in portal film and simulation film. The CAIMT has been applied to register the image pairs of a rando phantom and real subjects. The promising results suggest the CAIMT can assist radiotherapists to make precise registrations for the simulation film and the portal film and therefore determine an optimal radiation beam positioning in a more efficient way.
Robust integration for speech features
Authors: Kuo-Chang Huang, Yau-Tarng Juang, Wen-Chieh Chang
Venue: Signal Processing (2006)

Deployment of speech recognizers sometimes involves ambient conditions that are not present during the training phase of the operation. This environment mismatch is one major source of performance degradation for speech recognizers. This paper aims at the feature integration that is robust to the ambient environment change. Our consideration focuses on the speech cepstrum and the group delay spectrum (GDS), derived from linear prediction coefficients. We present a new feature integration approach for robust speech recognition in adverse conditions. Based on the robustness of cepstrum under clean environment and the robustness of GDS under noisy environment, it is effective by suitably combining the cepstral coefficient and the GDS coefficient for noise-resistance of speech in different condition mismatch. The performance of the proposed method is experimentally evaluated in speaker-independent isolated-word recognition task using the hidden Markov model (HMM) under various noise conditions. Noisy speech is simulated by adding noise sources taken from the NOISEX-92 database. Experimental results obtained show that the new robust feature is effective for the speech recognition with significant noise and yields better performance than other feature coefficients. A substantial increase in recognition accuracy is observed in all testing noise environments at all different SNRs.
There Is No "I" in "Robot": Robots and Utilitarianism
Authors: Christopher Grau
Venue: IEEE Intelligent Systems (2006)

Utilizing the film I, Robot as a springboard, this article considers the feasibility of robotutilitarians, the moral responsibilities that come with the creation of ethical robots, and the possibilityof distinct ethics for robot-robot interaction as opposed to robot-human interaction. This article is part of a special issue on Machine Ethics.