ppxscal/embedding_network huggingface dataset:
Probabilistic Relational Database Applications for Biomedical Informatics
Authors: Ping-Tsai Chung, Hsin-Hua Hsiao
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In the information age, information is usually communicated and exchanged with heterogeneous databases in a distributed internetworking environment. When multiple heterogeneous databases show different values for the same data item, its actual value is not known with certainty. Probabilistic relational databases have extended from the relational database model by incorporating probability measures to capture the data uncertainty associated with data items. In this paper, we apply the probabilistic relational database techniques to the area of biomedical informatics. We address the issue of database interoperability by using a data warehousing approach to resolve mismatched domains and to integrate information from different data sources. We then develop query processing strategies to effectively evaluate and answer queries from the consolidated database.
ODAP: an ontological approach for expressing the semantics of analysis patterns in conceptual modeling
Authors: Merete Hvalshagen, Vijay Khatri
Venue: Information Technology and Management (2008)

Systematic software reuse is emerging as a promising route to improved software development productivity and quality. While many benefits of patterns reuse have been identified, there is a need to develop a mechanism for supporting and automating the reuse of relevant analysis patterns for conceptual modeling. To enable effective reuse of analysis patterns, extant approaches require judgment about correctly instantiating and combining the analysis patterns. Building on prior research in ontology and conceptual modeling, we propose a "top-down" approach, referred to as Ontology for Describing Analysis Patterns (ODAP), to explicitly express the semantics of analysis patterns. We show how ODAP helps provide a mechanism to identify appropriate instances of analysis patterns including the discovery of valid combinations with other patterns in a patterns base. Thus, ODAP can enable communication of the meaning of the analysis pattern constructs to modelers and be the basis for a design support environment that supports the development of conceptual schemas using analysis patterns.
In Situ Adaptive Feature Extraction for Underwater Target Classification
Authors: J. Tory Cobb, Jason R. Stack
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

This research compares the performance improvements of image-based sonar target classification algorithms when they are adapted to changing clutter environments. The distribution of seabed pixels in the sonar imagery is modeled as a correlated, K-distributed random variable allowing for a quantitative representation of seabed environments in the various testing scenarios. Parameterized environments comprising various target-like seabed textures are generated synthetically and used to examine adaptive classification performance. Results demonstrate that optimizing classifier parameters respective to specific environments improves overall classification performance compared to optimizing classifier parameters against a pooled dataset that includes all possible environments.
An Autonomic Peer-to-Peer Architecture for Hosting Stateful Web Services
Authors: Christoph Reich, Kris Bubendorfer, Rajkumar Buyya
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper we present an autonomic web services architecture that manages both the performance of service containers and the interconnection of those containers into a service overlay network. The advantages of this approach include the easing of management tasks through the autonomic systems ability to self-configure, self-optimise and self-heal. We also benefit from improved resilience and anticipate an improvement in overall performance. In our architecture we incorporate a structured distributed hash table peer-to-peer overlay network within our autonomic web services container. Our architecture is inherently non-hierarchical, widely distributed and enables SLA compliant deployment of WSRF services. We have simplified the management of such a system by adhering to autonomic principles, and we maintain the performance of the system by tightly integrating SLA compliance and migrating services between containers to preserve QoS. We have developed a workable system for both service deployment and migration without the need for global state.
A pervasive personal trainer, an electronic leash, a light canvas...
Authors: Maria Ebling, Mark Corner
Venue: IEEE Pervasive Computing (2008)

This installment covers several new devices, most of which are used during activities—a pervasive personal trainer, a Wi-Fi-enabled SD card for eases photo uploading, a new 99-quid laptop focused on the education market, an electronic leash for wandering children, and a new artist medium for reducing stress in a hospital waiting room.
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
Authors: M. Mihail
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A direct combinatorial argument is given to bound the convergence rate of Markov chains in terms of their conductance (these are statements of the nature 'random walks on expanders converge fast'). In addition to showing that the linear algebra in previous arguments for such results on time-reversible Markov chains was unnecessary, the direct analysis applies to general irreversible Markov chains.
Security Policy Pre-evaluation towards Risk Analysis
Authors: Yi Han, Yoshiaki Hori, Kouichi Sakurai
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Nowadays, security policy evaluation becomes a very hot topic since high QoP(Quality of Protection) is required by more and more people. Most of the researchers focus on the security policy evaluation after they have been enforced into real application systems via some real attacks. However,before security policy enforcement, the policy themselves may also contain some anomalies which shouldn’t be ignored. In this paper, we pointed out the importance of security policy pre-evaluation which focuses on security policy evaluation before policy enforcement. In addition we propose a framework for it towards risk analysis. As a concrete example, we show how to apply our framework to firewall security policies. Finally we discuss the difficulty of our proposal and show future work interests.
A critical evaluation of location based services and their potential
Authors: Jonathan Raper, Georg Gartner, Hassan Karimi, Chris Rizos
Venue: Journal of Location Based Services (2007)

This Editorial lead article for the Journal of Location Based Services surveys this complex and multi-disciplinary field and identifies the key research issues. Although this field has produced early commercial disappointments, the inevitability that pervasive location-aware services on mobile devices will emerge means that much research is needed to inform these developments. The article reviews firstly: the science and technology of positioning, geographic information science, mobile cartography, spatial cognition and interfaces, information science, ubiquitous computing; and secondly the business, content and legal, social and ethics aspects, before synthesising the key issues for this new field.
Improving navigation interaction in digital documents
Authors: George Buchanan, Tom Owen
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper investigates novel interactions for supporting within-document navigation. We focus on one specific interaction: the following of figure references. Through this interaction we illuminate factors also found in other forms of navigation. Three alternative interactions for supporting figure navigation are described and evaluated through a user study. Experimentation proves the advantages of our interaction design, and the degree to which the interaction of existing reader software can be improved.
An energy-efficient fault-tolerant monitoring system for sensor networks
Authors: Changlei Liu, Guohong Cao
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

Because sensors are often deployed in harsh and/or adversarial environments, the sensors or the communication links may fail and hence endanger the mission of the sensor network. Although using more redundant sensors can tolerate some sensor failures, in most cases, only limited sensors are awake to extend the network life time. Therefore, sensor status (such as liveness, density estimation, residue energy, etc.) has to be closely monitored and made known to the sink, which can promptly react to the sensor status changes.
Widths of embeddings in function spaces
Authors: Jan Vybíral
Venue: Journal of Complexity (2008)

We study the approximation, Gelfand and Kolmogorov numbers of embeddings in function spaces of Besov and Triebel-Lizorkin type. Our aim here is to provide sharp estimates in several cases left open in the literature and give a complete overview of the known results. We also add some historical remarks.
Overlapped Layers for Prolonging Network Lifetime in Multi-Hop Wireless Sensor Networks
Authors: Hongyan Wang, Mei Yang, Yingtao Jiang, Shupeng Wang, Laximi Gewali
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, the bottleneck problem in PRMC-based wireless sensor networks is studied. This problem can be solved by overlapping neighboring layers. By this way, more cluster head candidates are available for each layer and the intra-cluster communication energy can be reduced, which ultimately helps prolonging network lifetime. Through analysis and numeric results, the reasonable overlapped ranges are decided such that the energy consumption among the cluster heads of different layers is balanced. Simulation results with the selected overlapped ranges confirm that overlapping neighboring layers balances the energy consumption among cluster heads of different layers and prolongs network life time.
Study of a piezoelectric multimorph based micro-scanner
Authors: A. Chaehoi, M. Begbie
Venue: Microsystem Technologies (2008)

This paper concerns the modeling of a piezoelectric micro-scanner. The micro-scanner presented in this paper uses multimorph-type bending actuators to tilt a square plate mirror. A complete analytical model of the piezoelectric micro-scanner is presented. Each step of the modeling has been validated by Finite Element Modeling. This theoretical model based on strength of material equations calculates the force generated by the multimorphs on the mirror, the profile of the structure and the angular deflection of the mirror. The proposed model, used to optimize the design of the piezoelectric silicon micro-scanner, is intended for further HDL integration, thereby allowing rapid system level simulation and optimization.
CAD to SIM: CAD Model Conversion for Dymola-based Mechatronic Simulation
Authors: Tamás Juhász, Ulrich Schmucker
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Virtual product development allows us to recognize and evaluate the characteristics of a new product on the basis of simulation at an early stage without having to build a physical prototype. Currently the most, widely spread CAE systems do not have multi-domain simulation support, nor do offer direct interfaces to external dynamic simulation applications. These systems disallow the complex simulation of the designed virtual product. Conversely, dynamic simulation of a detailed virtual prototype is required to maintain good correlation between the behaviour of the real product and its virtual counterpart. In this paper a largely automated workflow will be presented, how a convenient conversion can be achieved to Modelica models from the output of a CAD system considering Dymola-based multi-domain simulation.
A Fuzzy Approach for Analyzing Outliers in Gene Expression Data
Authors: Noha A. Yousri, Mohamed S. Kamel, Mohamed A. Ismail
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Outlier gene expression patterns identify abnormal gene behavior, possibly indicating the deviation in gene function for certain tumor types. It may also reveal novel gene-tumor relations, as well as novel tumor types. This is important in designing drugs for tumors as well as in studying the functional relations between genes. Apart from identifying outliers, associating outliers to the clusters in a gene expression dataset can reveal information about the source of outliers, i.e. to which tumors they are related. This work proposes a fuzzy approach which combines outlier detection and clustering results, to analyze gene expression outliers based on their relations to clusters. Both outlier detection and clustering are done based on a connectivity-based clustering algorithm, and the results are then combined using an iterative technique that propagates fuzzy memberships from patterns to their neighbors. Experimental results on leukaemia expression patterns are used to illustrate the proposed approach.
An interactive game-design assistant
Authors: Mark J. Nelson, Michael Mateas
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Game-design novices increasingly hope to use game-like expression as a way to express content such as opinions and educational material. Existing game-design toolkits such as Game Maker ease the programming burden, bringing the design of small games within the technical reach of low-budget, non-expert groups. The design process itself remains a roadblock, however: It is not at all obvious how to present topics such as political viewpoints or bike safety in a way that makes use of the unique qualities of the interactive game medium. There are no tools to assist in that aspect of the game design process, and as a result virtually all expressive games come from a small number of game studios founded by experts in designing such games. We propose a game-design assistant that acts in a mixed-initiative fashion, helping the author understand the content of her design-in-progress, providing suggestions or automating the process where possible, and even offering the possibility for parts of the game to be dynamically generated at runtime in response to player interaction. We describe a prototype system that interactively helps authors define spaces of games in terms of common-sense constraints on their real-world references, provides support for them to understand and iteratively refine such spaces, and realizes specific games from the spaces as playable mobile-phone games in response to user input.
Analysis and Prediction of Global and Subfamily-specific Functional Sites in Bioaminergic Receptors
Authors: Dan Xue, Long Liang, Jingyuan Yin
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Bioaminergic receptors are involved in controlling a variety of physiological functions. An approach to predict the functional sites in bioaminergic receptors was described and applied in this study. Given an alignment and receptors with already known subfamily definition, the method identified the global and subfamily-specific functional sites based on the position-specific conservation score in both family and subfamily. Global functional sites which highly conserved in the bioaminergic receptors are play important roles in structure and responsible for the common mechanisms of receptor activation and G protein coupling. Subfamily-specific functional sites are conserved in one subfamily but vary between other subfamilies. They are mainly involved in ligand binding and G protein coupling. As research about these subfamily-specific sites is rather limited, our prediction data have an important meaning for further elucidating the specific functions of subfamily in bioaminergic receptors.
The Hamster Revolution: How to Manage Your Email Before It Manages You
Authors: Mike Song, Vicki Halsey, Tim Burress
Venue:  (2007)

The Hamster Revolution is a timely solution to both the widespread problem of email overload as well as most people's inefficient (or nonexistent) systems for categorizing and storing email messages. This book provides the practical steps needed to deal with these problems and become more efficient in our work.
A low power layered decoding architecture for LDPC decoder implementation for IEEE 802.11n LDPC codes
Authors: Jie Jin, Chi-Ying Tsui
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

This paper presents a low power LDPC decoder design based on reducing the amount of memory access. By utilizing the column overlapping of the LDPC parity check matrix, the amount of access for the memory storing the posterior values is minimized. In addition, a thresholding decoding scheme is proposed which reduces the memory access by trading off the error correcting performance. The decoder was implemented in TSMC 0.18μm CMOS process. Experimental results show that for a LDPC decoder targeting for IEEE 802.11n, the power consumption of the memory and the decoder can be reduced by 72% and 24%, respectively.
Design of Bio-inspired Fault-tolerant Adaptive Routing Based on Enzymatic Feedback Control in the Cell: Towards Averaging Load Balance in the Network
Authors: Akiyuki Iwasaki, Tadasuke Nozoe, Takeshi Kawauchi, Masahiro Okamoto
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The routing algorithm of SPF is widely distributed in the Internet. Since this routing algorithm is designed in order to improve throughput of each packet, it is not suitable for averaging load balance in the network. On the contrary, metabolic networks in the cell can realize load balance and achieve fault-tolerance by using enzymatic feedback mechanism. That is, a metabolic pathway in the cell is composed of a lot of enzymatic reaction steps in which biochemical reactant (substrate) is converted to the product by unique enzyme, and the product of a late step frequently acts as an inhibitor of the first committed step in this pathway (feedback control). This way, the end product of a pathway controls its own synthesis and prevents useless accumulation of intermediates and of end product. Recently, by mimicking enzymatic feedback mechanism in the cell, we have designed a fault-tolerant adaptive routing algorithm to avoid the partial and time-variant congestions in the network. We evaluated and compared the proposed algorithm with SPF and ECMP (Equal Cost Multi-path Protocol) by using the simulation of test data. The simulation results show that the proposed algorithm can remarkably improve both latency, load balance and fault tolerance. Since there are enormous numbers of nodes in the Internet, however, it is difficult to replace all existing nodes to the proposed nodes. In this paper, we shall propose an efficient method for the allocation of adaptive nodes in random and a scale-free network composed of 100 nodes. Examined the time-variant traffic at each node, and only focused on around 10% top ranked heavy-traffic nodes, we replace such nodes to our proposed adaptive nodes. By doing this, we could design a fault-tolerant adaptive routing, which can dynamically average load-balance within the network.
Orchestrating the execution of stream programs on multicore platforms
Authors: Manjunath Kudlur, Scott Mahlke
Venue: ACM SIGPLAN Notices (2008)

While multicore hardware has become ubiquitous, explicitly parallel programming models and compiler techniques for exploiting parallelism on these systems have noticeably lagged behind. Stream programming is one model that has wide applicability in the multimedia, graphics, and signal processing domains. Streaming models execute as a set of independent actors that explicitly communicate data through channels. This paper presents a compiler technique for planning and orchestrating the execution of streaming applications on multicore platforms. An integrated unfolding and partitioning step based on integer linear programming is presented that unfolds data parallel actors as needed and maximally packs actors onto cores. Next, the actors are assigned to pipeline stages in such a way that all communication is maximally overlapped with computation on the cores. To facilitate experimentation, a generalized code generation template for mapping the software pipeline onto the Cell architecture is presented. For a range of streaming applications, a geometric mean speedup of 14.7x is achieved on a 16-core Cell platform compared to a single core.
Teaching cryptography with open-source software
Authors: Alasdair McAndrew
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Cryptography has become an important topic in undergraduate curricula in mathematics and computer science, not just for its intrinsic interest---``about the most fun you can have with mathematics''\cite{ferg04, but for its current standing as the basis for almost all computer security. From wireless networking to secure email to password protection, cryptographic methods are used to secure information, to protect users, and to protect data. At Victoria University, cryptography has been taught as part of a mathematics and computer science degree for several years. The students all have had at least a year of tertiary mathematics, and some exposure to a computer algebra system (Maple). However, the cost of Maple, and the current licensing agreement, means that students are unable to experiment with the software away from the computer laboratories at the University. For this reason we have decided to investigate the use of open-source computer algebra systems Maxima and Axiom. Although not as full-featured and powerful as the commercial systems Maple and Mathematica, we show they are in fact admirably suited for a subject such as cryptography. In some ways Maxima and Axiom even surpass Maple and Mathematica. Student response to the introduction of these systems has been very positive.
Performance Impact of Task-to-Task Communication Protocol in Network-on-Chip
Authors: Nader Bagherzadeh, Masaru Matsuura
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Network-on-Chip (NoC) is a strong candidate for scalable interconnect design of Multi-Processor System-on-Chip (MPSoC). Software tasks of MPSoC require a certain protocol to communicate with each other. In NoC such a communication protocol should be handled at Network Interface and/or Processor Element level and it is expected that different protocols show their trade-offs. In consideration of the above, we employed two types of basic protocol and investigated their performance impact. The contribution of this work is to quantitatively evaluate effectiveness of using separate communication protocols depending on the task structure.