ppxscal/embedding_network huggingface dataset:
Synchronous versus conjunctive binding: a false dichotomy?
Authors: R. F. Hadley
Venue: Connection Science (2007)

A long-standing issue in connectionist research has concerned the manner in which the human brain contrives to bind values to variables, fillers to roles, and (sensory) features to features. This paper examines the comparative merits of two binding methods whose biological foundations have been empirically confirmed, namely, binding via synchronous firing and binding via conjunctive coding. Within the community of connectionist researchers, it is often asserted that synchronous binding is far more efficient, in terms of the number of neurons required, than conjunctive coding. Moreover, Singer (Neuron, 24, pp. 49-65, 1999) has argued that conjunctive coding is inadequate as a general method of binding, for several cognitively based reasons. This paper argues that the above-cited complaints against conjunctive binding are not decisive. It is further noted that synchronous firing is a surface phenomenon-one that requires an explanation in terms of underlying causes. A model is proposed herein that illustrates one way in which synchronous bindings could be engendered by a substratum that relies, ultimately, upon conjunctive binding nodes. It is demonstrated that such a substratum would require a feasibly small number of conjunctive neurons.
Producing interpretable local models in parametric CMAC by regularization
Authors: John Q. Gan, Eric M. Rosales
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

Cerebellar model articulation controller (CMAC) has been widely applied to modeling and control due to its attractive features such as fast training speed and parsimonious structure. A parametric CMAC is a CMAC model with its constant weights replaced by linear functional weights or linear local models, i.e., a type of Tagaki-Sugeno fuzzy model. This paper proposes a regularized parametric CMAC, and investigates how its linear local models are able to approximate the local linearity of the nonlinear system to be modeled by using regularization techniques and how the regularized parametric CMAC can be successfully applied in modeling a nonlinear process for state estimation of unknown nonlinear processes. Experimental results on the approximation ability and interpretability of the regularized parametric CMAC and its application to nonlinear state estimation have been presented to demonstrate the advantages of the regularized parametric CMAC.
Using User Preferences to Enhance Privacy in Pervasive Systems
Authors: Elizabeth Papadopoulou, Sarah McBurney, Nick Taylor, M. Howard Williams, Kajetan Dolinar, Martin Neubauer
Venue: Proceedings of the Third International Conference on Systems (2008)

With the increasing interest in developing pervasive computing technologies there is growing recognition of the problems of maintaining user privacy. In the Daidalos pervasive system this is achieved primarily through the use of virtual identities, which are used to conceal the real identity of the user. One problem with this lies in determining to what extent the user should be engaged in the decisions relating to the selection of virtual identities, and what can be done automatically. The solution lies in creating a set of user preferences to assist in taking these decisions, refining them through the use of machine learning techniques. This paper outlines the approach being investigated and describes how this will be achieved when the processes involved in building up user preferences are not trusted.
From human regulations to regulated software agents' behavior
Authors: Javier Vázquez-Salceda, Huib Aldewereld, Davide Grossi, Frank Dignum
Venue: Artificial Intelligence and Law (2008)

In order to design and implement electronic institutions that incorporate norms governing the behavior of the participants of those institutions, some crucial steps should be taken. The first problem is that human norms are (on purpose) specified on an abstract level. This ensures applicability of the norms over long periods of time in many different circumstances. However, for an electronic institution to function according to those norms, they should be concrete enough to be able to check them run time. A second problem is that norms describe which behavior is desirable and permitted, but not how this is achieved in an institution. In the "real world" regulations often indicate procedures for implementing and enforcing the law. Likewise we should devise means to annotate the norms with practical aspects such as enforcement mechanisms, sanctions, etc. in order to get requirements for an institution that will enforce norms (by either constraining behavior within the norms or reacting to violation of the norms). The choice of which kind of mechanism is chosen is not a normative one, but usually based on criteria of efficiency and/or feasibility of the mechanism. In this paper we present our view on how to approach these problems and other related issues to be solved in order to develop e-institutions capable to operate in complex, highly regulated scenarios.
Stopping conditions for exact computation of leave-one-out error in support vector machines
Authors: Vojtěch Franc, Pavel Laskov, Klaus-Robert Müller
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We propose a new stopping condition for a Support Vector Machine (SVM) solver which precisely reflects the objective of the Leave-One-Out error computation. The stopping condition guarantees that the output on an intermediate SVM solution is identical to the output of the optimal SVM solution with one data point excluded from the training set. A simple augmentation of a general SVM training algorithm allows one to use a stopping criterion equivalent to the proposed sufficient condition. A comprehensive experimental evaluation of our method shows consistent speedup of the exact LOO computation by our method, up to the factor of 13 for the linear kernel. The new algorithm can be seen as an example of constructive guidance of an optimization algorithm towards achieving the best attainable expected risk at optimal computational cost.
Automated measurement and analysis of effectiveness of teaching selected Excel topics in an introductory IS class
Authors: Marc Waldman, Mehmet Ulema
Venue: Journal of Computing Sciences in Colleges (2008)

Measuring the effectiveness of teaching is a challenging task. This paper presents the initial results of an effort to measure the effectiveness of teaching core Excel topics in an "Introduction to Information Systems (IS)" Class. To do this, a lab-based pretest was administered before Excel was covered in class, and the same test was given after the topic was complete. A custom software was developed to analyze these tests in an attempt to understand which Excel skills the students acquired or improved during the course. The second half of the paper describes the design of this custom software as well as the lessons learned during the development and deployment of the Excel module.
Miscellaneous problems on infinite graphs
Authors: R. Halin
Venue: Journal of Graph Theory (2000)

A collection of open problems on infinite graphs is presented, divided into twelve sections which are largely independent of each other. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 35: 128&ndash;151, 2000 In memory of my academic father Professor Klaus Wagner.
Interactive Rendering of Dynamic Geometry
Authors: Federico Ponchio, Kai Hormann
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Fluid simulations typically produce complex three-dimensional iso-surfaces whose geometry and topology change over time. The standard way of representing such dynamic geometry is by a set of iso-surfaces that are extracted individually at certain time steps. An alternative strategy is to represent the whole sequence as a four-dimensional tetrahedral mesh. The iso-surface at a specific time step can then be computed by intersecting the tetrahedral mesh with a three-dimensional hyperplane. This not only allows to animate the surface continuously over time without having to worry about the topological changes, but also enables simplification algorithms to exploit temporal coherence. We show how to interactively render such four-dimensional tetrahedral meshes by improving previous GPU-accelerated techniques and building an out-of-core multi-resolution structure based on error-quadric simplification. As a second application we apply our framework to time-varying surfaces that result from morphing one triangle mesh into another.
Shared Descriptions Fusion Coding for Storage and Selective Retrieval of Correlated Sources
Authors: Sharadh Ramaswamy, Kenneth Rose
Venue: Proceedings of the Data Compression Conference (2008)

Motivated by sensor networks, we consider the fusion storage of correlated sources in a database, such that any subset of them may be efficiently retrieved in the future. Only statistical information about future queries is available during encoding and storage. Fusion coding of correlatedsources poses new challenges due to the conflicting objectives of exploiting inter-source correlations and enabling efficient {\em selective} retrieval. Practical signal compression imposes additional constraints on system complexity. We propose a shared-descriptions approach for the design of lossy fusion coding systems, to managethe precise tradeoffs between storage rate, retrieval rate,distortion and system complexity, within one unified framework. An iterative descent algorithm is derived for the design of such fusion coders. The optimized system provides significant gains over traditional quantization techniques that are not directly optimized for fusion coding.
Interworking architectures for IP multimedia subsystems
Authors: Arslan Munir, Vincent W. S. Wong
Venue: Mobile Networks and Applications (2007)

The future fourth generation wireless heterogeneous networks aim to integrate various wireless access technologies and to support the IMS (IP multi-media subsystem) sessions. In this paper, we propose the Loosely Coupled Satellite-Cellular-WiMAX-WLAN (LCSCW2) and the Tightly Coupled Satellite-Cellular-WiMAX-WLAN (TCSCW2) interworking architectures. The LCSCW2 and TCSCW2 architectures use the loosely coupling and tightly coupling approach, respectively. Both of them integrate the satellite networks, third generation (3G) wireless networks, worldwide interoperability for microwave access (WiMAX), and wireless local area networks (WLANs). They can support IMS sessions and provide global coverage. The LCSCW2 architecture facilitates independent deployment and traffic engineering of various access networks. The TCSCW2 architecture can provide quality of service (QoS) guarantee. We also propose an analytical model to determine the associate cost for the signaling and data traffic for inter-system communication in these architectures. The cost analysis includes the transmission, processing, and queueing costs at various entities. Numerical results are presented for different arrival rates and session lengths.
A method for designing fault diagnosis filters for LPV polytopic systems
Authors: Sylvain Grenaille, David Henry, Ali Zolghadri
Venue: Journal of Control Science and Engineering (2008)

The work presented in this paper focuses on the design of robust Fault Detection and Isolation (FDI) filters for dynamic systems characterized by LPV (Linear Parameter Varying) polytopic models. A sufficient condition is established to guarantee sensitivity performance of the residual signal vector to faults. Robustness constraints against model perturbations and disturbances are also taken into account in the design method. A key feature of the proposed method is that the residual structuring matrices are optimized as an integral part of the design, together with the dynamic part (i.e. the filter). The design problem is formulated as a convex optimization problem and solved using LMI (Linear Matrix Inequalities) techniques. The proposed method is illustrated on the secondary circuit of a Nuclear Power Plant.
Visualization Enhancement of Arthrosis Tissues Structure in Ultrasound Image Based on Improved Diffusion
Authors: Wei Wang, Yang Liu, Yingxia Shen, Baowei Liu, Yanjun Shi, Ping Gao, Yuerong Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Structure visualization and identification for ultrasound (US) arthral structure images is essential in US-guided arthrosis operation and diagnosis for arthrosis disorder. US imaging can image arthrosis tissues and cartilaginous, but it often depicts the structure poorly, because of speckle, reverberation, shadowing feature and other artifacts. The enhancement of arthrosis structure visualization remains great challenge in US images. This paper proposes an improved diffusion to remove reverberation noise, smoothing speckles and improve the visualization of arthrosis structure in US images. The structure tensor from automatic detection is applied to keep edges structure. The potential of the method is demonstrated with the results compared to nonlinear diffusion. The preliminary results show that improved diffusion is a robust method to enhance surfaces visualization of US arthrosis structure. The method shows promise in a clinical application of arthrosis operation planning and arthrosis diagnosis.
Recognizable languages in divisibility monoids
Authors: Manfred Droste, Dietrich Kuske
Venue: Mathematical Structures in Computer Science (2001)

We define the class of divisibility monoids that arise as quotients of the free monoid &Sigma;&#x002A; modulo certain equations of the form ab = cd. These form a much larger class than free partially commutative monoids, and we show, under certain assumptions, that the recognizable languages in these divisibility monoids coincide with c-rational languages. The proofs rely on Ramsey's theorem, distributive lattice theory and on Hashigushi's rank function generalized to these monoids. We obtain Ochma&nacute;ski's theorem on recognizable languages in free partially commutative monoids as a consequence.
Techniques for analyzing dynamic random graph models of web-like networks: An overview
Authors: Aurel Cami, Narsingh Deo
Venue: Networks (2008)

Various random graph models have recently been proposed to replicate and explain the topology of large, complex, real-life networks such as the World Wide Web and the Internet. These models are surveyed in this article. Our focus has primarily been on dynamic random graph models that attempt to account for the observed statistical properties of web-like networks through certain dynamic processes guided by simple stochastic rules. Particular attention is paid to the equivalence between mathematical definitions of dynamic random graphs in terms of inductively defined probability spaces and algorithmic definitions of such models in terms of recursive procedures. Several techniques that have been employed for studying dynamic random graphs&mdash;both heuristic and analytic&mdash;are expounded. Each technique is illustrated through its application in analyzing various graph parameters, such as degree distribution, degree-correlation between adjacent nodes, clustering coefficient, distribution of node-pair distances, and connected-component size. A discussion of the most recent salient work and a comprehensive list of references in this rapidly-expanding area are included. &copy; 2007 Wiley Periodicals, Inc. NETWORKS, 2008
On the hardness of finding symmetries in Markov decision processes
Authors: Shravan Matthur Narayanamurthy, Balaraman Ravindran
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this work we address the question of finding symmetries of a given MDP. We show that the problem is Isomorphism Complete, that is, the problem is polynomially equivalent to verifying whether two graphs are isomorphic. Apart from the theoretical importance of this result it has an important practical application. The reduction presented can be used together with any off-the-shelf Graph Isomorphism solver, which performs well in the average case, to find symmetries of an MDP. In fact, we present results of using NAutY (the best Graph Isomorphism solver currently available), to find symmetries of MDPs.
Multimedia ready handoff scheme for 802.11 networks
Authors: Gurpal Singh, Ajay Pal Singh, B. S. Sohi
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Fast and multimedia ready handoffs are the prime requirement as IEEE 802.11 wireless networks are increasingly being deployed for providing voice and other real time services at public places like airports, hotels and university campuses. We have proposed and implemented a multimedia ready handoff technique aimed at reducing handoff latency to less than 10ms. Handoff latency has been reduced by decoupling scanning from handoff execution process. Mobile nodes continuously gather the neighbour information using optimized Background Scanning. This scheme has been implemented in the form of client side application with modifications to open source Madwifi driver. Performance of this handoff scheme has been evaluated on experimental Testbed for finding its suitability for real time applications. Effect of the proposed scheme on commercial VoIP client, Skype has been evaluated. Effect of the proposed handoff and optimized Background Scan on audio and video streaming has also been investigated. Results show that the proposed handoff and optimized background scanning cast minimal effect on real time VoIP and audio/video streaming traffic and are multimedia ready.
A citation analysis of the ACE2005--2007 proceedings, with reference to the June 2007 CORE conference and journal rankings
Authors: Raymond Lister, Ilona Box
Venue: Proceedings of the tenth conference on Australasian computing education - Volume 78 (2008)

This paper compares the CORE rankings of computing education conferences and journals to the frequency of citation of those journals and conferences in the ACE2005, 2006 and 2007 proceedings. The assumption underlying this study is that citation rates are a measure of esteem, and so there should be a positive relationship between citation rates and rankings. The CORE conference rankings appear to broadly reflect the ACE citations, but there are some inconsistencies between citation rates and the journal rankings. The paper also identifies the most commonly cited books in these ACE proceedings. Finally, in the spirit of "Quis custodiet ipsos custodes?" the paper discusses some ways in which the CORE rankings process itself might in future be made more transparent and open to scholarly discourse.
Coupled Transformation of Schemas, Documents, Queries, and Constraints
Authors: Joost Visser
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Coupled transformation occurs when multiple software artifacts must be transformed in such a way that they remain consistent with each other. For instance, when a database schema is adapted in the context of system maintenance, the persistent data residing in the system's database needs to be migrated to conform to the adapted schema. Also, queries embedded in the application code and any declared referential constraints must be adapted to take the schema changes into account. As another example, in XML-to-relational data mapping, a hierarchical XML Schema is mapped to a relational SQL schema with appropriate referential constraints, and the XML documents and queries are converted into relational data and relational queries. The 2LT project is aimed at providing a formal basis for coupled transformation. This formal basis is found in data refinement theory, point-free program calculation, and strategic term rewriting. We formalize the coupled transformation of a data type by an algebra of information-preserving data refinement steps, each witnessed by appropriate data conversion functions. Refinement steps are modeled by so-called two-level rewrite rules on type expressions that synthesize conversion functions between redex and reduct while rewriting. Strategy combinators are used to composed two-level rewrite rules into complete rewrite systems. Point-free program calculation is applied to optimized synthesize conversion function, to migrate queries, and to normalize data type constraints. In this paper, we provide an overview of the challenges met by the 2LT project and we give a sketch of the solutions offered.
Nonlinear multiresolution image blending
Authors: Mark Grundland, Rahul Vohra, Gareth P. Williams, Neil A. Dodgson
Venue: Machine Graphics Vision International Journal (2006)

We study contrast enhancement for multiresolution image blending. In image compositing, image stitching, and image fusion, a blending operator combines coefficients of a pixel array, an image pyramid, a wavelet decomposition, or a gradient domain representation. Linear interpolation reduces variation and thereby causes contrast loss, while coefficient selection increases variation and thereby causes color distortion. Offering a continuous range of possibilities between these standard alternatives, the signed weighted power mean enables the user to calibrate the contrast of composite images.
Biosensing Based on Surface Plasmon Resonance of Gold Nanohole and Nanoring Arrays Fabricated by a Novel Nanosphere Lithography Technique
Authors: Farah Fida, Ramin Banan-Sadeghian, Ahmad-Reza Hajiaboli, Yahia Djaoued, Simona Badilescu, Subramanian Balaji, M. Kahrizi, Vo-Van Truong
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

An optical biosensor based on gold nanohole arrays was developed using a new nanosphere lithography technique. A vertical deposition method was used to deposit multilayers of a polystyrene (PS) – gold composite on a silanized glass substrate. The SEM images have shown that the gold nanohole and nanoring arrays are distributed uniformly on the substrate. The sensitivity of the gold Surface Plasmon Resonance (SPR) band to the environment was found to be dependent on the geometry of the array. The new nanostructures have been used as platforms for rapid screening of biomolecular interactions. Fibrinogen and biotin absorption studies conducted with the functionalized gold nanostructures demonstrated the feasibility of using them to monitor biomolecular interactions. The sensitivity was found to be around 300 nm∙RIU-1, which is adequate for biosensing applications. The present technique has the advantage of simplicity; the structures can be prepared without any special equipment and a standard cell can be used for optical measurements.
Moving objects detection based on CNNs and clustering
Authors: G. Costantini, D. Casali, M. Carota
Venue: Proceedings of the 9th International Conference on Circuits (2005)

An analog CNN algorithm is proposed for detection of moving objects in high-resolution gray-scale images, with multiple moving objects and with moderate a priori information on the scene. The algorithm is based on simple 3×3 templates followed by a clustering operation on the moving pixels. The effectiveness of the proposed algorithm is shown using some real-life indoor and outdoor images.
SUPPORTING THE CAD STRUCTURAL DESIGN PROCESS WITH KNOWLEDGE-BASED TOOLS
Authors: Carlos Toro, Jorge Posada, Joaquín Oyarzun, Juanjo Falcón
Venue: Cybernetics and Systems (2007)

We present in this article an architecture with its correspondent system implementation for the exploitation of semantic aspects in the computer assisted design of Steel Detailing Structures (Structural Design). Our architecture is based in a domain specific standardization effort called CIS/2 that was modeled from a knowledge point of view using an OWL (Ontology Web Language) compliant ontology. As test case we present a collection of applications based in the proposed schema that were developed within the frame of an R&D project in which an actual structural engineering company participated as test user.