ppxscal/embedding_network huggingface dataset:
Visual specification of measurements and redesigns for domain specific visual languages
Authors: Esther Guerra, Juan de Lara, Paloma Díaz
Venue: Journal of Visual Languages and Computing (2008)

Ensuring model quality is a key success factor in many computer science areas, and becomes crucial in recent software engineering paradigms like the one proposed by model-driven software development. Tool support for measurements and redesigns becomes essential to help developers improve the quality of their models. However, developing such helper tools for the wide variety of (frequently domain specific) visual notations used by software engineers is a hard and repetitive task that does not take advantage from previous developments, thus being frequently forgotten. In this paper we present our approach for the visual specification of measurements and redesigns for Domain Specific Visual Languages (DSVLs). With this purpose, we introduce a novel DSVL called SLAMMER that contains generalisations of some of the more used types of internal product measurements and redesigns. The goal is to facilitate the task of defining measurements and redesigns for any DSVL, as well as the generation of tools from such specification reducing or eliminating the necessity of coding. We rely on the use of visual patterns for the specification of the relevant elements for each measurement and redesign type. In addition, SLAMMER allows the specification of redesigns either procedurally or by means of graph transformation rules. These redesigns can be triggered when the measurements reach a certain threshold. These concepts have been implemented in the meta-modelling tool AToM^3. In this way, when a DSVL is designed, it is possible to specify measurements and redesigns that will become available in the final modelling environment generated for the language. As an example, we show a case study in the web modelling domain.
The tradeoff between maximizing the sensor network lifetime and the fastest way to report reliably an event using reporting nodes' selection
Authors: Fatma Bouabdallah, Nizar Bouabdallah
Venue: Computer Communications (2008)

Energy-efficiency is one of the major concerns in wireless sensor networks since it impacts the network lifetime. In this paper, we investigate the relationship between sensor networks performance, particularly its lifetime, and the number of reporting nodes N by using both analytical and simulation approaches. We first show that the network lifetime and the number of correctly received reports increase when N decreases. Moreover, we demonstrate that the average time required to report an event is a convex function of N. Based on these results, and as a main contribution, we prove that the optimal number of reporting nodes minimizing the energy consumption in the network does not correspond to the optimal number of reporting nodes allowing the fastest way to report an event. The tradeoff between these two requirements is therefore specific to each sensor application, depending on its particular needs. In this paper, we provide a simple methodology to achieve this tradeoff.
Proceedings of the 2nd international workshop on Systems development in SOA environments
Venue: International Conference on Software Engineering (2008)

Welcome to the 2nd International Workshop on Systems Development in SOA Environments -- SDSOA 2008. The overall goal of this workshop is to provide a forum for a concerted effort to develop a long-term community-wide research agenda for the successful development of service-oriented systems. We hope to bring together researchers and practitioners in this area that represent various strands of research activity and practical methodologies, so that we can collaboratively identify open research issues and continue addressing SOA research issues of interest to the community. During 2007, the Software Engineering Institute, in collaboration with a team of researchers, developed a taxonomy of SOA research topics that would improve SOA adoption and the development of service-oriented systems. The taxonomy is divided into research issues pertaining to the business, engineering and operation aspects of service-oriented systems, plus a set of cross-cutting aspects. A specific objective of this workshop is to identify new challenges that can be used to evolve the research agenda. We received 20 papers from Africa, Australia, Canada, Europe and the United States. These papers covered important SOA research topics such as dynamic service composition; designing SOA-based systems for qualities such as usability, reusability and performance; runtime monitoring and adaptation of SOA-based systems; application of known software engineering methodologies in an SOA context; and examples of how SOA can support business process management (BPM). The program committee accepted 14 of these papers, representative of the challenges related to service-oriented systems development. Many thanks to all the authors that submitted position papers for the workshop, as well as the program committee for their thorough reviews. We hope that you will find the selected papers interesting and that they trigger ideas for future work and research in service-oriented systems development.
Fundamental study: Directional dynamics for cellular automata: A sensitivity to initial condition approach
Authors: Mathieu Sablik
Venue: Theoretical Computer Science (2008)

A cellular automaton is a continuous function F defined on a full-shift A^Z which commutes with the shift @s. Often, to study the dynamics of F one only considers implicitly @s. However, it is possible to emphasize the spatio-temporal structure produced by considering the dynamics of the ZxN-action induced by (@s,F). In this purpose we study the notion of directional dynamics. In particular, we are interested in directions of equicontinuity and expansivity, which generalize the concepts introduced by Gilman [Robert H. Gilman, Classes of linear automata, Ergodic Theory Dynam. Systems 7 (1) (1987) 105-118] and P. Kurka [Petr Kurka, Languages, equicontinuity and attractors in cellular automata, Ergodic Theory Dynam. Systems 17 (2) (1997) 417-433]. We study the sets of directions which exhibit this special kind of dynamics showing that they induce a discrete geometry in space-time diagrams.
On rank vs. communication complexity
Authors: N. Nisan, A. Wigderson
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

This paper concerns the open problem of Lovasz and Saks (1988) regarding the relationship between the communication complexity of a Boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.
Cross-disciplinary molecular science education in introductory science courses: an nsdl matdl collection
Authors: David J. Yaron, Jodi L. Davenport, Michael Karabinos, Gaea L. Leinhardt, Laura M. Bartolo, John J. Portman, Cathy S. Lowe, Donald R. Sadoway, W. Craig Carter, Colin Ashe
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

This paper discusses a digital library designed to help undergraduate students draw connections across disciplines, beginning with introductory discipline-specific science courses (including chemistry, materials science, and biophysics). The collection serves as the basis for a design experiment for interdisciplinary educational libraries and is discussed in terms of the three models proposed by Sumner and Marlino. As a cognitive tool, the library is organized around recurring patterns in molecular science, with one such pattern being developed for this initial design experiment. As a component repository, the library resources support learning of these patterns and how they appear in different disciplines. As a knowledge network, the library integrates design with use and assessment.
Search for Liouvillian solutions of linear recurrence equations in the MAPLE computer algebra system
Authors: D. E. Khmelnov
Venue: Programming and Computing Software (2008)

The paper considers implementation of the Singer-Hendriks algorithm in the MAPLE computer algebra system. The algorithm finds Liouvillian solutions of linear recurrence equations with coefficients in the form of rational functions.
Simulation Study of a Connection-Oriented Internet Service Based on a Queueing Model
Authors: Zhanqiang Huo, Naishuo Tian, Wuyi Yue, Shunfu Jin
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we analyze the operating mechanism of a connection-oriented Internet service. Considering the finite buffer size in a connection-oriented Internet service, we establish a Geom/Geom/1/\textit{K} queueing model with setup-close delay-close down feature for user-initiated sessions. Using a simulation approach, we study the performance measures of Quality of Service (QoS) in terms of system throughput, system response time, and system blocking probability. Based on the simulation results, we discuss the influence of the upper limit of close delay period and the capacity of the buffer on the performance measures. Findings from such an analysis may potentially be applied in the design, resource assigning, and optimal setting for the next generation Internet.
Efficient parallel algorithms for chordal graphs
Authors: P. N. Klein
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The author gives efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadth-first search tree and a depth-first search tree of a chordal graph, recognizing interval graphs, and testing interval graphs for isomorphism. The key to the results is an efficient parallel algorithm for finding a perfect elimination ordering.
RA-model: a taxonomy model of player activities in mobile MMORPGs
Authors: Fang You, Jianmin Wang, Zibin Zheng, Jihong Jung, Chunhui Che, Xiaonan Luo, Peter Tam
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)

In this paper, we present a player taxonomy model for MMORPGs on mobile phone: RA-Model (Relationship and Achievement Taxonomy Model). This model uses two player motivations: Relationship and Achievemen to explain why players play the game. All players in the game can be divided into 3 types: Socializer, Moderator and Fighter based on their scores of Relationship and Achievement. This model has been applied on a commercially launched mobile massively multi-player online role playing game (MMORPG) "ZhanGuo"[10], which has been run on more than 800 types of mobile phones owned by a million subscribers since 2005 in China. RA-Model can be used to control player balance and analyze player payment in the game, which will provide useful information to the game design.
Live Network Performance Challenge: FLASH-OFDM vs. HSDPA
Authors: Andres Arjona, Antti Ylä-Jääski, Jussi Kerttula
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

HSDPA networks are intensively being deployed to provide mobile broadband connectivity to mobile devices. In addition to HSDPA, FLASH-OFDM is another wireless broadband option operating in a licensed spectrum. However, if operated at very low frequencies like the network in Finland, it is particularly interesting for emerging markets, especially for rural areas which are lacking telecommunications infrastructure. In contrast to the HSDPA standards, the FLASH-OFDM systems are proprietary. The market dynamics are very different between standardized and proprietary systems, sometimes causing extra challenges for the deployment of proprietary systems.This paper provides quantitative measurements of the actual performance of two state-of-the-art live networks in Finland. The evaluation includes metrics such as throughput, delay, and VoIP quality considering network performance both on static and mobile scenarios. A commercial deployment evaluation is included in the analysis complementing the measurement data in order to provide a comprehensive view of the challenges.
Multi-Agent Classifiers Fusion Strategy for Biomedical Named Entity Recognition
Authors: Haochang Wang, Tiejun Zhao, Jianmiao Liu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Recognizing the biomedical named entity has become one of the most fundamental tasks in the biomedical knowledge discovery. The multi-agent classifiers fusion approach proposed here was found to efficiently recognize biomedical named entity. We employ Conditional Random Fields as our underlying classifier model and incorporate diverse set of features into system, the relativity between classifiers is utilized by using co-decision matrix to exchange decision information among classifiers. The experiments are carried on GENIA corpus with the best result of 77.88% F-sore. The multi-agent classifier fusion strategy proposed here is obviously superior to the individual classifier based method and more effective than the classifiers fusion approach of boosting and bagging.
Predicting Protein-Protein Interactions with Pseudo Amino Acid Composition
Authors: Yu-Dong Cai, Guo-Ping Zhou
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Given two proteins in a living system, can we predict whether they are interacting with each other merely according to the information of their sequences? This is an interesting problem because knowledge of protein-protein interactions may be applied to protein subunit aggregation, to computer-aided drug design, and to fundamental problems of cellular signalling and expression. With the explosion of newly-found protein sequences in the post-genomic era, its importance has become self-evident, and the challenge to address it even more urgent. Based on the pseudo amino acid composition (Chou, K.C.: PROTEINS: Structure, Function, and Genetics, 43: 246-255, 2001) approach and nearest neighbor rule, a predictor called “NN-PseAA” classifier was developed to deal with this problem. As a showcase, prediction was performed on 8,797 fruitfly protein pairs. To avoid redundancy and homology bias, none of the protein pairs investigated has sequence identity with any other. The overall success rate obtained by jackknife cross-validation for such a stringent dataset was 73.74%, indicating a quite promising sign of the new approach in stimulating the development of this important area and other related areas.
Interface Implementation Using Ajax for Web-Based Instruction Set Simulator
Authors: Hideaki Yanagisawa, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

SSC-DASH (Server Side C-DASH) has been developed as a web-based HW/SW codesign tool for designing processors. SSC-DASH obtains a processor definition file via web browser and generates a HW (synthesizable Verilog-HDL description) and SWDE (Software Development Environment) for the generated processor. The SWDE includes ISS (Instruction Set Simulator), assembler, disassembler and compiler. For the verification of the defined processor, processor developers have to download the generated SWDE, every time, even where changes are small. To improve the usability of this system a web-based interface for the generated SWDE is implemented using Ajax. Using Ajax, download of the SWDE becomes unnecessary and makes it possible to verify the processor on the server quickly and easily. This greatly improves the usability of the SWDE. In this paper, we describe implementation of web-based ISS using Ajax.
Links between directional derivatives through multidirectional mean value inequalities
Authors: Rafael Correa, Pedro Gajardo, Lionel Thibault
Venue: Mathematical Programming: Series A and B (2008)

We prove in the general setting of lower semicontinuous functions on Banach spaces the relation between the Rockafellar directional derivative and the mixed lower limit of the lower Dini derivatives. As a byproduct we derive the famous inclusions of tangent cones of closed sets in Banach spaces. The results are established using as principal tool multidirectional mean value inequalities [Aussel et&#x00a0;al., SIAM J Optim 9(3), 690&#x2013;706 (1999)].
Hamilton connectivity of line graphs and claw-free graphs
Authors: Zhiquan Hu, Feng Tian, Bing Wei
Venue: Journal of Graph Theory (2005)

Let G be a graph and let V0 = {&nu;&epsilon; V(G): dG(&nu;) = 6}. We show in this paper that: (i) if G is a 6-connected line graph and if |V0| &le; 29 or G[V0] contains at most 5 vertex disjoint K4's, then G is Hamilton-connected; (ii) every 8-connected claw-free graph is Hamilton-connected. Several related results known before are generalized. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory
Modelling the US, UK and Japanese unemployment rates: Fractional integration and structural breaks
Authors: Guglielmo Maria Caporale, Luis A. Gil-Alana
Venue: Computational Statistics Data Analysis (2008)

A general procedure for fractional integration and structural breaks at unknown points in time is used, which allows for different orders of integration and deterministic components in each subsample. First, the procedure is extended to the non-linear case, and it is shown by means of Monte Carlo experiments to perform well in a non-linear environment. Second, it is applied to test for a single break in the unemployment rate in the US, the UK and Japan. The results shed some light on the empirical relevance of alternative unemployment theories for these countries. Specifically, a structuralist interpretation appears more appropriate for the US and Japan, whilst a hysteresis model accounts better for the UK experience (and also for the Japanese one in the second subsample). These findings are interpreted in terms of structural instability in labour markets with different features.
Partial order reduction for scalable testing of systemC TLM designs
Authors: Sudipta Kundu, Malay Ganai, Rajesh Gupta
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is non-deterministic. To leverage testing of a SystemC TLM design, we focus on automatically exploring all possible behaviors of the design for a given data input. We combine static and dynamic partial order reduction techniques with SystemC semantics to intelligently explore a subset of the possible traces, while still being provably sufficient for detecting deadlocks and safety property violations. We have implemented our exploration algorithm in a framework called Satya and have applied it to a variety of examples including the TAC benchmark. Using Satya, we automatically found an assertion violation in a benchmark distributed as a part of the OSCI repository.
Testing the effects of positional uncertainty on spatial decision-making
Authors: S. Hope, G. J. Hunter
Venue: International Journal of Geographical Information Science (2007)

There is now increasing agreement that the uncertainty associated with spatial information should be represented to users in a manner that is comprehensive and unambiguous. To assist with this task, researchers have developed a variety of methods to portray spatial uncertainty. While there has been some testing of the effectiveness of these displays, the possible effects of such representations on decision-making have not yet been thoroughly investigated. Indeed, studies from the psychological literature indicate that people do not always make the same decisions when presented with the same information, and they can also be sensitive to the effects of presentation, task, and context. This paper examines how the use of four different methods to represent positional uncertainty can affect spatial decision-making. The authors found that extremely significant differences in participants' responses were exhibited, depending on the manner in which positional uncertainty was displayed, although little difference was observed in the ability of the participants to comprehend the four display methods. In addition, strong preferences were recorded for certain representations over others.
Mining significant graph patterns by leap search
Authors: Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. Most objective functions are not antimonotonic, which could fail all of frequency-centric graph mining algorithms. In this paper, we give the first comprehensive study on general mining method aiming to find most significant patterns directly. Our new mining framework, called LEAP (Descending Leap Mine), is developed to exploit the correlation between structural similarity and significance similarity in a way that the most significant pattern could be identified quickly by searching dissimilar graph patterns. Two novel concepts, structural leap search and frequency descending mining, are proposed to support leap search in graph pattern space. Our new mining method revealed that the widely adopted branch-and-bound search in data mining literature is indeed not the best, thus sketching a new picture on scalable graph pattern discovery. Empirical results show that LEAP achieves orders of magnitude speedup in comparison with the state-of-the-art method. Furthermore, graph classifiers built on mined patterns outperform the up-to-date graph kernel method in terms of efficiency and accuracy, demonstrating the high promise of such patterns.
Novel Biomaterial Study II: O, O-Dilong Chain Acyl Chitosan (OCS) for Self-Assembled Nanovesicle and OCS/PLLA Blend for Tissue Engineering Scaffold
Authors: Meihua Xin, Mingchun Li, Yaozu Liao, Jun Deng, Zhiyong Qiao
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

A novel amphiphilic chitosan, O,O-dilong chainacyl chitosan (OCS), was applied to prepare self-assembled vesicles for DDS and OCS/PLLA blend for tissue engineering scaffold. The study on morphology, drug-releasing behavior of the vesicles, and the bioexperiments of OCS vesicles and OCS/PLLA blend elucidate the relative results are similar to NCS vesicles and NCS/PLLA blend.
Adaptive Data Dissemination in Sensor Networks Using WPDD
Authors: Falko Dressler, Reinhard German, Bettina Krüger
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In Wireless Sensor Networks (WSNs), address-based routing approaches often lead to severe problems due to node mobility, energy-saving sleep-cycles, and often missing or unreliable address information. Data-centric routing schemes such as flooding or gossiping solve these problems but may lead to congestion or starvation. Based on biologically inspired mechanisms known from cellular signaling pathways, we discovered potentials in enhancing the communication required for self-organization in network environments suffering from data paths with low reliability and time variations of the reliability. Using an importance factor for particular transmissions in combination with feedback loops, the overall quality of the global system can be increased. The resulting algorithm, Weighted Probabilistic Data Dissemination (WPDD), includes an inherent adaptation to changing network conditions. Congestion control is supported as well as prioritized data communication. This paper outlines the working behavior of WPDD and demonstrates its applicability based on selected simulation results.