ppxscal/embedding_network huggingface dataset:
Stability of Parallel Queueing Systems with Coupled Service Rates
Authors: Sem Borst, Matthieu Jonckheere, Lasse Leskelä
Venue: Discrete Event Dynamic Systems (2008)

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the system are derived, based on stochastic monotonicity and marginal drift properties of multiclass birth and death processes. These conditions yield a sharp characterization of stability for systems where the service rate of each queue is decreasing in the number of customers in other queues, and has uniform limits as the queue lengths tend to infinity. The results are illustrated with applications where the stability region may be nonconvex.
Solvable Performances of Optimization Neural Networks with Chaotic Noise and Stochastic Noise with Negative Autocorrelation
Authors: Mikio Hasegawa, Ken Umeno
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

By adding chaotic sequences to a neural network that solves combinatorial optimization problems, its performance improves much better than the case that random number sequences are added. It was already shown in a previous study that a specific autocorrelation of the chaotic noise makes a positive effect on its high performance. Autocorrelation of such an effective chaotic noise takes a negative value at lag 1, and decreases with dumped oscillation as the lag increases. In this paper, we generate a stochastic noise whose autocorrelation is C(¿) ≈ C ×( ¿ r) ¿ , similar to effective chaotic noise, and evaluate the performance of the neural network with such stochastic noise. First, we show that an appropriate amplitude value of the additive noise changes depending on the negative autocorrelation parameter r. We also show that the performance with negative autocorrelation noise is better than those with the white Gaussian noise and positive autocorrelation noise, and almost the same as that of the chaotic noise. Based on such results, it can be considered that high solvable performance of the additive chaotic noise is due to its negative autocorrelation.
Wavenet: A Wavelet-Based Approach to Monitor Changes on Data Distribution in Networks
Authors: Mei Li, Ping Xia, Wang-Chien Lee
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

A massive amount of data is available in distributed fashion on various networks, including Internet, peer-to-peer networks, and wireless sensor networks. Users are often interested in monitoring interesting patterns or abnormal events hidden in these data. Transferring all the raw data from each host node to a central coordinator for processing is costly and unnecessary. In this study, we investigate the problem of monitoring changes on the data distribution in the networks (MCDN). To address this problem, we propose a technique, called wavenet, by compressing the local item set in each host node into a compact yet accurate summary, called local wavelet, for communication with the coordinator. We also propose adaptive monitoring to address the issues of local wavelet propagation in wavenet. An extensive performance evaluation has been conducted to validate our proposal and demonstrates the efficiency of wavenet.
A template-based reconstruction of plane-symmetric 3D models from freehand sketches
Authors: Sang-Uk Cheon, Soonhung Han
Venue: Computer-Aided Design (2008)

This paper presents a method for reconstructing a 3D model from a freehand sketch. There are two methods used in sketch-based modeling research: gestural modeling and reconstructional modeling. This research involves the reconstructional modeling method of Mitani, which was originally designed for a box-shaped model using a predefined template. Here, this method is improved by leveraging a relational template and a template matching method that extend the range of categories of the reconstructed objects. Sketch preprocessing details are provided and the template-based reconstructional method then uses the sketch preprocessing results to reconstruct a 3D model from a freehand sketch.
A Flexible System for the Retrieval of Shapes in Binary Images
Authors: Gloria Bordogna, Luca Ghilardi, Simone Milesi, Marco Pagani
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper a flexible retrieval system of shapes present in binary digital images is described: it allows customizing the retrieval function to evaluate weighted criteria constraining distinct shape characteristics of the objects in the images such as global features of contour (represented by the Fourier Coefficients), contour's irregularities (represented by the Multifractal Spectrum), presence of concavities-convexities (represented by the Contour Scale Space distribution). Further also the matching function comparing the representations of the shapes can be tuned to define a more or less strict interpretation of similarity. The evaluation experiments showed that this system can be suited to different retrieval purposes, and that generally the combination of the distinct shape indexing criteria increases both Recall and Precision with respect to the application of any single indexing criterion alone.
Evaluation of an appearance-based 3D face tracker using dense 3D data
Authors: Fadi Dornaika, Angel D. Sappa
Venue: Machine Vision and Applications (2008)

The ability to detect and track human heads and faces in video sequences can be considered as the finest level of any video surveillance system. In this paper, we introduce a general framework for evaluating our recent appearance-based 3D face tracker using dense 3D data. This tracker combines online appearance models with an image registration technique and can run in real-time and is drift insensitive. More precisely, accuracy and usability of this developed tracker are assessed using stereo-based range facial data from which ground truth 3D motions are computed. This evaluation quantifies the monocular tracker accuracy, and identifies its working range in 3D space. Additionally, this evaluation gives some hints on how the tracker can be fully exploited.
Algorithm Development for Distributed Memory Multicomputers Using CONLAB
Authors: Peter Jacobson, Bo Kågström, Mikael Rännar
Venue: Scientific Programming (1992)

CONLAB (CONcurrent LABoratory) is an environment for developing algorithms for parallel computer architectures and for simulating different parallel architectures. A user can experimentally verify and obtain a picture of the real performance of a parallel algorithm executing on a simulated target architecture. CONLAB gives a high-level support for expressing computations and communications in a distributed memory multicomputer (DMM) environment. A development methodology for DMM algorithms that is based on different levels of abstraction of the problem, the target architecture, and the CONLAB language itself is presented and illustrated with two examples. Simulotion results for and real experiments on the Intel iPSC/2 hypercube are presented. Because CONLAB is developed to run on uniprocessor UNIX workstations, it is an educational tool that offers interactive (simulated) parallel computing to a wide audience.
Reusing Collaborative Knowledge as Learning Objects ---The Implementation and Evaluation of AnnForum
Authors: Weiqin Chen, Richard Persen
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

With the development and adoption of digital technologies in learning, there is an increasingly large amount of learner-generated material being stored or recorded. This learner-generated material could contain important learning resources. This paper presents our research in reusing collaborative knowledge generated in a knowledge building process as learning objects. We describe the implementation and evaluation of AnnForum --- a system which can dynamically annotate and classify collaborative knowledge and detect messages which are relevant to current discussion topics and present them to the learners. With the help of AnnForum, a new knowledge building process can be built, based upon previous accumulated knowledge instead of starting from scratch.
TADL - An Architecture Description Language for Trustworthy Component-Based Systems
Authors: Mubarak Mohammad, Vasu Alagar
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Existing architecture description languages mainly support the specification of the structural elements of the system under design with either only a limited support or no support to specify non-functional requirements. In a component-based development of trustworthy systems, the trustworthiness properties must be specified at the architectural level. Analysis techniques should be available to verify the trustworthiness properties early at design time. Towards this goal we present in this paper a meta-architecture and TADL, a new architecture description language suited for describing the architecture of trustworthy component-based systems. The TADL is a uniform language for specifying the structural, functional, and nonfunctional requirements of component-based systems. It also provides a uniform source for analyzing the different trustworthiness properties.
On planar intersection graphs with forbidden subgraphs
Authors: János Pach, Micha Sharir
Venue: Journal of Graph Theory (2008)

Let ${\cal C}$ be a family of n compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with k vertices in each of its classes. Then $G({\cal C})$ has at most n times a polylogarithmic number of edges, where the exponent of the logarithmic factor depends on k. In the case where ${\cal C}$ consists of convex sets, we improve this bound to O(n log n). If in addition k&thinsp;=&thinsp;2, the bound can be further improved to O(n). &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 59: 205&ndash;214, 2008
Queuing analysis of multi-hop CSMA/CA wireless networks handling many traffic flows
Authors: Ben Lauwens, Bart Scheers, Antoine Van de Capelle
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper a semi-analytical model for the evaluation of the queuing performance in CSMA-CA multi-hop wireless networks with arbitrary topology is proposed. The intrinsic fairness of single-hop wireless networks can be used to model the network as a processor sharing system with multiple queues, one for each node, and a fair scheduling regime. In the multi-hop scenario, the queuing performance depends on the access protocol, the network topology and the traffic profiles on all links. In a previous paper a model is introduced which allows the calculation of the saturation throughput of nodes in multi-hop CSMA-CA networks with RTS/CTS enabled access. A simplified version of the method is used to estimate the resources of the servers in a many-sources large deviations analysis of a queuing system with multiple coupled servers. The queuing performance of wireless networks can be evaluated by mapping the different servers to the nodes in the network. The cumulative complementary distribution function of the buffer occupation of a node for different topologies is calculated by a novel method and compared to the results of an event-driven simulation with the same settings. A good fit between the semi-analytical model and the simulation is obtained.
A Rich Servants Service Model for Pervasive Computing
Authors: Huai-Dong Shi, Ming Cai, Jin-Xiang Dong, Peng Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Pervasive computing has received an intensive interest in the past years and will be a fertile source of challenging research problems in computer systems for many years to come, but there is still no good model to distinguish it from other technologies, such as distributed system, mobile computing, etc. This paper presents a Rich Servants Service (RSS) Model to help researchers understand pervasive computing, demonstrate the features and evaluate the implementations of pervasive computing systems. The model also exposes several research problems of pervasive computing for further research. A prototype based on the RSS Model is designed and demonstrated to prove the interpretation and evaluation capability of the model.
Recognition of Shipping Container Identifiers Using ART2-Based Quantization and a Refined RBF Network
Authors: Kwang-Baek Kim, Minhwan Kim, Young Woon Woo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Generally, it is difficult to find constant patterns on identifiers in a container image, since the identifiers are not normalized in color, size, and position, etc. and their shapes are damaged by external environmental factors. This paper distinguishes identifier areas from background noises and removes noises by using an ART2-based quantization method and general morphological information on the identifiers such as color, size, ratio of height to width, and a distance from other identifiers. Individual identifier is extracted by applying the 8-directional contour tracking method to each identifier area. This paper proposes a refined ART2-based RBF network and applies it to the recognition of identifiers. Through experiments with 300 container images, the proposed algorithm showed more improved accuracy of recognizing container identifiers than the others proposed previously, in spite of using shorter training time.
Synthesizing Proactive Assistance with Heterogeneous Agents
Authors: Amedeo Cesta, Gabriella Cortellessa, Federico Pecora, Riccardo Rasconi
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

This paper describes outcome from a project aimed at creating an instance of integrated environment endowed with heterogeneous software and robotic agents to actively assist an elderly person at home. Specifically, a proactive environment for continuous daily activity monitoring has been created in which an autonomous robot acts as the main interactor with the person. This paper describes how the synergy of different technologies guarantees an overall intelligent behavior capable of personalized and contextualized interaction with the assisted person.
Analysis and Visualization of Spatial Proteomic Data for Tissue Characterization
Authors: Christian Fuchsberger, Heidi Hübl, Georg Schäfer, Alexandre Pelzer, Georg Bartsch, Helmut Klocker, Nicola Barbarini, Riccardo Bellazzi, Wolfgang Wieder, Günther Bonn
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Spatial proteomic profiling of tissue sections provides in situ molecular analysis of proteins and peptides. Analysis and visualization of these high-dimensional data cubes is challenging. We present a methodology for this task based on a novel developed algorithm for the feature identification and reduction step. To show the validity of our approach, we analyzed prostate cancer tissue sections with an adapted kernel-density based clustering algorithm.
Integrating the task-based approach and the grammar translation method with computer-assisted instruction on taiwanese efl college students' speaking performance
Authors: Kenneth B. Kelch
Venue:  (2008)

The Problem. The purpose of this study was to investigate the integrating of the task-based approach with computer-assisted instruction and the Grammar Translation Method with computer-assisted instruction on Taiwanese EFL Taiwan College students' speaking performance. Method. Ninety-three Taiwanese EFL college students from the Hsing Wu College were selected to participate in this study. For the purpose of the study, the participants during the 12-week academic term were divided into two study groups: experimental group and control group (one intact group of 50 was randomly selected to be the experimental group; the other group of 43 students was assigned to the control group). This study was a mixed method research which included quantitative and qualitative method. For the quantitative data collection and analysis, students of both the experimental group and control group were given a background information questionnaire and pre- and post-test of students' English proficiency test called the GEPT (General English Proficiency Test). Additionally, for the qualitative data collection and analysis, the instructor and 10 students (five from the experimental group and five from the control group) were individually interviewed by the researcher. Results. The results of this study indicate that students of the task-based approach with computer-assisted instruction showed the higher post-test speaking scores than students of the grammar translation method with computer-assisted instruction; in particular, the task-based approach with computer-assisted instruction showed a significant increase in their scores from the pretest to the posttest. According to interview of the students, both the task-based approach with computer-assisted instruction and the Grammar Translation Method with computer-assisted instruction indicated that they were more motivated and obtained more knowledge learning English with computer-assisted instruction. Additionally, the instructor recommended that combining the advantages of two methodologies, the task-based approach with computer-assisted instruction and the Grammar Translation Method with computer-assisted instruction, in future curriculum design may provide the best improvement in students' performance.
Mashing Up Context-Aware Web Applications: A Component-Based Development Approach
Authors: Florian Daniel, Maristella Matera
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Context-awareness and adaptivity in web applications have been gaining momentum in web engineering over the last years, and it is nowadays recognized that, more than a mere technology aspect, they represent a first-class design concern. This acknowledgment has led to a revision of existing design methods and languages, finally resulting in runtime adaptation being considered a cross-cutting aspect throughout the whole development process. In this paper, we propose a radically new view on context-awareness and show how a well-done component-based development may allow the fast mashup of context-aware and adaptive web applications. The proposed approach comes with an intuitive graphical development environment, which will finally enable even end users themselves to mash up their adaptive applications.
An MDA Approach for the Development of Spatial Data Warehouses
Authors: Octavio Glorio, Juan Trujillo
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

In the past few years, several conceptual approaches have been proposed for the specification of the main multidimensional (MD) properties of the spatial data warehouses (SDW). However, these approaches often fail in providing mechanisms to univocally and automatically derive a logical representation. Even more, the spatial data often generates complex hierarchies (i.e., many-to-many) that have to be mapped to large and non-intuitive logical structures (i.e., bridge tables). To overcome these limitations, we implement a Model Driven Architecture (MDA) approach for spatial data warehouse development. In this paper, we present a spatial extension for the MD model to embed spatiality on it. Then, we formally define a set of Query/ View/ Transformation (QVT) transformation rules which allow us, to obtain a logical representation in an automatic way. Finally, we show how to implement the MDA approach in our Eclipse-based tool.
Semantic-Enhanced Personalised Support for Knowledge Sharing in Virtual Communities
Authors: Styliani Kleanthous
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Virtual communities are currently one of the fastest growing applications on the web. In this research, we argue that personalised support should be tailored to the needs of the community as a whole, as opposed to adapting only to individuals. Based on 4 processes identified as important, we propose a computational framework that includes the extraction of a comprehensive community model and the deployment of that model to provide support adapted to the effective functioning of a community.
Topic Maps Matching Computation Based on Composite Matchers
Authors: Jungmin Kim, Hyunsook Chung
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, we propose a multi-strategic matching approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the Topic Maps. Our multi-strategic matching approach consists of a linguistic module and a Topic Map constraints-based module. A linguistic module computes similarities between concepts using morphological analysis, and language-dependent heuristics. A Topic Map constraints module takes advantage of several Topic Maps-dependent techniques such as a topic property-based matching, a hierarchy-based matching, and an association-based matching. It is not necessary to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the Topic Maps. Our experiments show that the automatically generated matching results conform to the outputs generated manually by domain experts, which is very promising for further work.
Secret Distribution for Secure Fingerprint Verification
Authors: Hanna Choi, Sungju Lee, Daesung Moon, Yongwha Chung, Sungbum Pan
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Recently, in the smart‐card based authentication system, there is an increasing trend of using fingerprint for the card holder verification, instead of passwords. However, the security of the fingerprint data is particularly important as the possible compromise of the data will be permanent. In this paper, we propose an approach for secure fingerprint verification by distributing both the secret and the computation based on the fuzzy vault(a cryptographic construct which has been proposed for crypto‐biometric systems). That is, a user fingerprint template which is applied to the fuzzy vault is divided into two parts, and each part is stored into a smart‐card and a server, respectively. At distributing the fingerprint template, we consider both the security level and the verification accuracy. Then, the geometric hashing technique is applied to solve the fingerprint alignment problem, and this computation is also distributed over the combination of the smart‐card and the server in the form of the challenge‐response. Finally, the polynomial can be reconstructed from the accumulated real points from both the smart‐card and the server. Based on the experimental results, we confirm that our proposed approach can perform the fuzzy vault‐based fingerprint verification more securely on a combination of a smart‐card and a server without significant degradation of the verification accuracy.