ppxscal/embedding_network huggingface dataset:
A computational architecture for heterogeneous reasoning
Authors: Dave Barker-Plummer, John Etchemendy
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

In this paper we describe a computational architecture for applications that support heterogeneous reasoning. Heterogeneous reasoning is, in its most general form, reasoning that employs representations drawn from multiple representational forms. Of particular importance, and the principal focus of the architecture, is heterogeneous reasoning which employs one or more forms of graphical representation, perhaps in combination with sentences (of English or another language, whether natural or scientific). Graphical representations include diagrams, pictures, layouts, blueprints, flowcharts, graphs, maps, tables, spreadsheets, animations, video, and 3D models. By 'an application that supports heterogeneous reasoning' we mean an application that allows users to construct, record, edit, and replay a process of reasoning using multiple representations so that the structure of the reasoning is maintained and the informational dependencies and justifications of the individual steps of the reasoning can be recorded.
Transient analysis of two-dimensional cylindrical fin with various surface heat effects
Authors: Kuang Yuan Kung, Shih-Ching Lo
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

An analytical solution to the transient heat conduction for a two dimensional cylindrical fin with general boundary conditions is obtained by the principle of superposition and separation variables. In the analysis, homogeneous material properties and thickness, the convective heat transfer coefficient, the ambient temperature and the fin properties are assume to be constant. The closed form transient temperature distribution and the heat transfer rate are generalized for a linear combination of the product of Bessel function, Fourier series and exponential.
Managing Process Interaction in IS Development Projects
Authors: Reza Khajavinia
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Increasingly, information systems must be developed and implemented as a part of business change. This is a challenge for the IS project manager, since business change and information systems development usually are performed as separate processes. Thus, there is a need to understand and manage the relationship between these two kinds of processes. To understand the interaction between information systems development and planned organizational change we introduce the concept of process interaction. We draw on a longitudinal case study of an IS development project that used an iterative and incremental development approach. The concept of process interaction enabled us to understand critical events in the case, in particular those that were important for the mutual adaptation between the information system and the organization. We conclude that process interaction is needed to facilitate socio-technical innovation in a situation where the organizational change process and the IS development process are parallel but incongruent. We also argue that iterative software engineering frameworks are well structured to support process interaction. Finally, we advocate that the IS project manager needs to manage the trade-off between necessary process interaction and the internal IS project schedule.
Modes in Asynchronous Systems
Authors: Jean-François Rolland, Jean-Paul Bodeveix, Mamoun Filali, David Chemouil, Dave Thomas
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

In this paper we study the mode concept in asynchronous systems. First, we propose an abstract TLA+ specification. Then, we discuss how the mode concepts proposed by the two architecture languages: Giotto and AADL could be related to this abstraction.
High-Performance Carry Select Adder Using Fast All-One Finding Logic
Authors: Sun Yan, Zhang Xin, Jin Xi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

A carry-select adder(CSA) can be implemented by using single ripple carry adder and an add-one circuit instead of using dual ripple-carry adders to reduce the area and power but with speed penalty. This paper proposes a new add-one circuits using the fast all-one finding circuit and low-delay multiplexers to reduce the area and accelerate the speed of CSA, and no restrictions are imposed on the design of the adder blocks. For bit length n = 64, this new carry-select adders requires approximate 38 percent fewer transistors and16 percent shorter delay than the original dual ripple-carry carry-select adder.
The roaring navigator: a group guide for the zoo with shared auditory landmark display
Authors: Christoph Stahl
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

In this paper, we introduce a shared auditory landmark display which conveys spatial survey knowledge and navigational aid to multiple users. Our guide is situated in a zoo environment, so we use recordings of animal voices to indicate the location of the animal enclosures. Spatial audio manipulates the volume and stereo balance of the sound clips, so that the listener can identify their distance and direction. The system also proactively presents audio clips with detailed information about each animal. To avoid the typical effect of social isolation through audio guides, we use shared audio so that the same sounds will be presented to each user at the same time. We have conducted an initial user study of paired visitors in the zoo to evaluate the usability of the system with positive results. The participants reported that the system is easy to use and has a stimulating influence on the communication between the visitors. As a further result, the study indicates that 'lightweight' navigational aid can be sufficient for wayfinding tasks in certain environments, which provides only the linear distance and direction of the destination.
A Relevance Feedback Method in Medical Image Retrieval Based on Bayesian Theory
Authors: Quan Zhang, Xiao-ying Tai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Earlier researches have proved that the gray co-occurrence matrix representing the texture feature is more effective than many other features in the sternum image retrieval and the relevance feedback technology implementing man-machine interactive retrieval enhance retrieval efficiency. Based on these conclusions, in this paper, a new relevance feedback method based on minimal Bayesian error rate in sternum image retrieval is proposed. The comparison of feedback retrieval result shows the approach is effective.
Experimental Study of the Retrodirective Antenna Array System in a Multipath Environment
Authors: Arjun Warrier, Zhizhang (David) Chen, Chris Loadman
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

The concept of retrodirective arrays was originated decades ago and various system architectures associated with it have been studied and developed in the past several years. However, the focus of the research so far has been on implementation algorithms and potential applications; although the retrocirective systems have been proposed for uses in communications, little has been carried out in evaluation of its communication performance metric. In this work, we first developed the software radio based retrodirective system and then placed it under test for its communication performance in an indoor environment that is rich of multipath. The test results demonstrate for the first time that the retrodirective system has superior performance in the two important performance parameters, the error-vector-magnitude (EVM) and bit-error-rate (BER). In a non-line-of-sight environment, the BER performance of a four-element retrodirective system can be three decades over that of a single antenna element system and two decades better than that of a conventional non-retrodirective array system with the same number of antenna elements.
Bayesian space conceptualization and place classification for semantic maps in mobile robotics
Authors: Shrihari Vasudevan, Roland Siegwart
Venue: Robotics and Autonomous Systems (2008)

The future of robots, as our companions is dependent on their ability to understand, interpret and represent the environment in a human compatible manner. Towards this aim, this work attempts to create a hierarchical probabilistic concept-oriented representation of space, based on objects. Specifically, it details efforts taken towards learning and generating concepts and attempts to classify places using the concepts gleaned. Several algorithms, from naive ones using only object category presence to more sophisticated ones using both objects and relationships, are proposed. Both learning and inference use the information encoded in the underlying representation-objects and relative spatial information between them. The approaches are based on learning from exemplars, clustering and the use of Bayesian network classifiers. The approaches are generative. Further, even though they are based on learning from exemplars, they are not ontology specific; i.e. they do not assume the use of any particular ontology. The presented algorithms rely on a robots inherent high-level feature extraction capability (object recognition and structural element extraction) capability to actually form concept models and infer them. Thus, this report presents methods that could enable a robot to to link sensory information to increasingly abstract concepts (spatial constructs). Such a conceptualization and the representation that results thereof would enable robots to be more cognizant of their surroundings and yet, compatible to us. Experiments on conceptualization and place classification are reported. Thus, the theme of this work is-conceptualization and classification for representation and spatial cognition.
Discovering topical structures of databases
Authors: Wensheng Wu, Berthold Reinwald, Yannis Sismanis, Rajesh Manjrekar
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solutions addressed mining for keys and foreign keys, but paid little attention to more high-level structures of databases. In this paper, we consider the problem of discovering topical structures of databases to support semantic browsing and large-scale data integration. We describe iDisc, a novel discovery system based on a multi-strategy learning framework. iDisc exploits varied evidence in database schema and instance values to construct multiple kinds of database representations. It employs a set of base clusterers to discover preliminary topical clusters of tables from database representations, and then aggregate them into final clusters via meta-clustering. To further improve the accuracy, we extend iDisc with novel multiple-level aggregation and clusterer boosting techniques. We introduce a new measure on table importance and propose an approach to discovering cluster representatives to facilitate semantic browsing. An important feature of our framework is that it is highly extensible, where additional database representations and base clusterers may be easily incorporated into the framework. We have extensively evaluated iDisc using large real-world databases and results show that it discovers topical structures with a high degree of accuracy.
Polycube splines
Authors: Hongyu Wang, Ying He, Xin Li, Xianfeng Gu, Hong Qin
Venue: Computer-Aided Design (2008)

This paper proposes a new concept of polycube splines and develops novel modeling techniques for using the polycube splines in solid modeling and shape computing. Polycube splines are essentially a novel variant of manifold splines which are built upon the polycube map, serving as its parametric domain. Our rationale for defining spline surfaces over polycubes is that polycubes have rectangular structures everywhere over their domains, except a very small number of corner points. The boundary of polycubes can be naturally decomposed into a set of regular structures, which facilitate tensor-product surface definition, GPU-centric geometric computing, and image-based geometric processing. We develop algorithms to construct polycube maps, and show that the introduced polycube map naturally induces the affine structure with a finite number of extraordinary points. Besides its intrinsic rectangular structure, the polycube map may approximate any original scanned data-set with a very low geometric distortion, so our method for building polycube splines is both natural and necessary, as its parametric domain can mimic the geometry of modeled objects in a topologically correct and geometrically meaningful manner. We design a new data structure that facilitates the intuitive and rapid construction of polycube splines in this paper. We demonstrate the polycube splines with applications in surface reconstruction and shape computing.
A Dynamic Hybrid Congestion Control Algorithm for Structured P2P Networks
Authors: Zhi Chen, Jingdong Xu, GuoWei Huang
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In structured P2P networks, the heterogeneity of node capacity and the skewness in query pattern could result in load imbalance and even congestion. VS-based migration and indegree adjustment are two typical solutions to address this problem. The former one is effective but incurs a high maintenance overhead, while the latter one is light-weighted but subject to its interior restriction. To combine the merits of these two existing approaches, this paper presents a hybrid congestion control algorithm. The basic idea behind our algorithm is that we first dynamically identify a group of nodes susceptible to congestion and then reallocate loads among them by indegree adjustment, and finally resort to VS-like proxy routing mechanism if the load exceeds the capacity of these nodes. The results of our simulation experiments show that our algorithm could effectively reduce the level of congestion with a low overhead.
Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks
Authors: Xiuwei Zhang, Maryam Zaheri, Bernard M. E. Moret
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Inferring transcriptional regulatory networks from gene-expression data remains a challenging problem, in part because of the noisy nature of the data and the lack of strong network models. Time-series expression data have shown promise and recent work by Babu on the evolution of regulatory networks in E. coli and S. cerevisiae opened another avenue of investigation. In this paper we take the evolutionary approach one step further. We conjecture that established phylogenetic relationships among a group of related organisms can be used to improve the inference of regulatory networks for these organisms from expression data gathered under similar conditions. We develop an inference algorithm to take advantage of such information and present the results of simulations (including various tests to exclude confounding factors) that clearly show the added value of the phylogenetic information. Our algorithm and results offer support for our conjecture and indicate that gene-expression studies under identical conditions across a range of related organisms could yield significantly more accurate regulatory networks than single-organism studies.
An accuracy evaluation of unstructured node-centred finite volume methods
Authors: Magnus Svärd, Jing Gong, Jan Nordström
Venue: Applied Numerical Mathematics (2008)

Node-centred edge-based finite volume approximations are very common in computational fluid dynamics since they are assumed to run on structured, unstructured and even on mixed grids. We analyse the accuracy properties of both first and second derivative approximations and conclude that these schemes cannot be used on arbitrary grids as is often assumed. For the Euler equations first-order accuracy can be obtained if care is taken when constructing the grid. For the Navier-Stokes equations, the grid restrictions are so severe that these finite volume schemes have little advantage over structured finite difference schemes. Our theoretical results are verified through extensive computations.
BlogWall: displaying artistic and poetic messages on public displays via SMS
Authors: Adrian David Cheok, Abd-ur-Rehman Mustafa, Owen Noel Newton Fernando, Anne-Katrin Barthoff, Janaka Prasad Wijesena, Naoko Tosa
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Short message service (SMS) is extremely popular today. Currently it is being mainly used for peer-to-peer communication. Electronic displays can be seen everywhere and those are mainly used to convey information to the masses rather than provide artistic and social communication. BlogWall extends the SMS to a new level of self expression and public communication by combining art and poetry. Furthermore it will provide a means of expression in the language that young people understand, and the forms of social communication. The user stands in front of a projected screen and sends a SMS to a given number. The system can display users SMS in an animated manner. It also provides users to participate in polls. The most notable feature of the application is its ability to create poetry in multiple languages such as English, Korean, Chinese poems or Japanese "Haiku" all based on the SMS. This is a step into new forms of cultural computing.
Strategies for effective use of exergy-based modeling of data center thermal management systems
Authors: Sara McAllister, Van P. Carey, Amip Shah, Cullen Bash, Chandrakant Patel
Venue: Microelectronics Journal (2008)

As power densities in data centers quickly increase, the inefficiencies of yesterday are becoming costly data center thermal management problems today. One proposed method to address the inefficiencies of state-of-the-art data centers is to use the concept of exergy. To this end, earlier investigations have used a finite-volume, uniform-flow computer model to analyze exergy destruction as a means of identifying inefficiencies. For this type of exergy-based program to be a useful engineering tool, it should: (i) be easy to set up, viz. establish grid size and impose system parameters; (ii) have a formulation that is solvable and numerically stable; (iii) be executable in reasonable time on a workstation machine with typical processor speed and memory; and (iv) model the physics with acceptable accuracy. This investigation explored specific strategies for achieving these features. This work demonstrates that optimally chosen computational strategies do enhance the usefulness of an exergy-based analysis program as an engineering tool for evaluating the thermal performance of a data center.
The Energy Endoscope: Real-Time Detailed Energy Accounting for Wireless Sensor Nodes
Authors: Thanos Stathopoulos, Dustin McIntire, William J. Kaiser
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

This paper describes a new embedded networked sensor platform architecture that combines hardware and software tools providing detailed, fine-grained real-time energy usage information. We introduce the LEAP2 platform, a qualitative step forward over the previously developed LEAP and other similar platforms. LEAP2 is based on a new low power ASIC system and generally applicable supporting architecture that provides unprecedented capabilities for directly observing energy usage of multiple subsystems in real-time. Real-time observation with microsecond-scale time resolution enables direct accounting of energy dissipation for each computing task as well as for each hardware subsystem. The new hardware architecture is exploited with our new software tools, etop and endoscope. A series of experimental investigations provide high-resolution power information in networking, storage, memory and processing for primary embedded networked sensing applications. Using results obtained in real-time we show that for a large class of wireless sensor network nodes, there exist several interdependencies in energy consumptionbetween different subsystems. Through the use of our measurement tools we demonstrate that by carefully selecting the system operating points, energy savings of over 60% can be achieved while retaining system performance.
Statistical properties of correlation on WSSUS channels
Authors: Victor M. Hinostroza, Alejandra Mendoza
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

To properly characterize the frequency and time selectivity of the fading channel, there several models used to simulate the channel, most of them based in the Jake's simulator. In this work the second order statistics of this simulator are compared to actual measurements. The second-order statistics level crossing rate (LCR) and average duration of fading (ADF) of a random process transmits useful information of the original process, especially in the diversity-combining process. In this work analysis of LCR and ADF in several environments was performed. LCR is calculated in several envelope thresholds and its relationship with envelope change is analyzed. Average duration of fades (ADF) for several thresholds is calculated and analyzed. Graphics are provided of LCR and ADF for several different indoor environments.
Pointwise uniformly convergent numerical treatment for the non-stationary Burger-Huxley equation using grid equidistribution
Authors: Aditya Kaushik
Venue: International Journal of Computer Mathematics (2007)

This article presents a numerical method for solving the singularly perturbed Burger-Huxley equation on a rectangular domain. That is, the highest-order derivative term in the equation is multiplied by a very small parameter. This small parameter is known as the perturbation parameter. When the perturbation parameter specifying the problem tends to zero, the solution of the perturbed problem exhibits layer behaviour in the outflow boundary region. Most conventional methods fail to capture this layer behaviour. For this reason, there is much current interest in the development of a robust numerical method that may handle the difficulties occurring due to the presence of the perturbation parameter and the nonlinearity of the problem. To solve both of these difficulties a numerical method is constructed. The first step in this direction is the discretization of the time variable using Euler's implicit method with a constant time step. This produces a nonlinear stationary singularly perturbed semidiscrete problem class. The problem class is then linearized using the quasilinearization process. This is followed by discretization in space, which uses the standard upwind finite difference operator. An extensive amount of analysis is carried out in order to establish the convergence and stability of the proposed method. Numerical experiments are carried out for model problems to illustrate graphically the theoretical results. The results indicate that the scheme faithfully mimics the dynamics of the differential equation.