ppxscal/embedding_network huggingface dataset:
Interoperability in enterprise modelling: Translation, elementary constructs, meta-modelling and UEML development
Authors: M. Roque, B. Vallespir, G. Doumeingts
Venue: Computers in Industry (2008)

Nowadays, one of the important objectives of research in the enterprise modelling domain is the development of a unified language, often called UEML (Unified Enterprise Modelling Language). UEML is expected to be a pivot language in order to manage the large amount of enterprise modelling languages and then to increase the interoperability in the domain of enterprise modelling. This paper is focused on one of the more illuminating aspects of UEML: the comparison of the constructs of the enterprise modelling language. Thus, the objective of this paper is to propose an approach allowing to provide some help concerning the identification of whose constructs are needed in UEML. This approach is based on the language meta-modelling, by using Unified Modelling Language (UML) language, and on the set theory. It is applied on a simple example of model translation between the SADT activity and the GRAI activity of GRAI nets.
Deciding Optimal Entropic Thresholds to Calibrate the Detection Mechanism for Variable Rate DDoS Attacks in ISP Domain
Authors: Anjali Sardana, Ramesh Joshi, Tai-hoon Kim
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

High bandwidth DDoS attacks consume more resources and have direct impact at ISP level in contrast to low rate DDoS attacks leading to graceful degradation of network and being mostly undetectable. Although an array of detection schemes have been proposed, current requirement is a real time DDoS detection mechanism that adapts itself to varying network conditions to give minimum false alarms. We treat DDoS attacks as events that disturb the distribution of traffic features in ISP domain reflected by entropic variations on in stream samples. Next we propose to calibrate the detection mechanism for minimum false alarm rate by varying tolerance factor in real time. Simulations are carried out in ns-2 at different attack strengths. We also report our experimental results over KDD 99 dataset. Results show that the proposed approach is comparable to previously reported approaches with an advantage of variable rate attack detection and minimum false alarms.
Examining life at the code face
Authors: Gabriela Avram, Liam J. Bannon, Anne Sheehan, Anders Sigfridsson, Daniel K. Sullivan
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

In this paper, we present the work of a research team at the University of Limerick, Ireland, focusing on work practices in a distributed software development environment. Adopting ethnographically-informed methods, the researchers have observed the activity of a software development team from an Irish subsidiary of a multinational company over a period of 18 months. The paper presents our perspective on the existing literature, the theoretical foundations of our work, and the approach we have taken. This research work is ongoing and in this paper we provide a selection of vignettes which the authors found of interest for a deeper analysis. Our aim is to understand the impact of the global distribution of software development on collaborative work practices in this particular work setting.
A new approach to finger print matching technique
Authors: D. M. Akbar Hussain, Henrik Legind Larsen, Shaiq A. Haq
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

A fingerprint is a pattern of ridges and valleys that exist on the surface of the finger. The uniqueness of a fingerprint is typically, determined by the overall pattern of ridges and valleys as well as the local ridge anomalies e.g., a ridge bifurcation or a ridge ending, which are called minutiae points. Designing a reliable automatic fingerprint matching algorithm is quite challenging. However, the popularity of fingerprint sensors as they are becoming smaller and cheaper, automatic identification based on fingerprints is becoming not only attractive but an alternative complement to the traditional methods of identification. The critical factor in the widespread use of fingerprints identification is, satisfying the performance e.g., matching the speed and accuracy requirements of the application. The widely used minutiae-based representation utilizes this discriminatory information available in a fingerprint for a matching. However, we extend this process of matching through a triangular feature to improve the matching process. The result shows that it has improvement in recognition process.
Time constrained graph searching
Authors: Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
Venue: Theoretical Computer Science (2008)

We consider time constraints for four models of searching graphs for intruders. One model is the standard cops and robber vertex-searching model with complete visibility. The second model differs from the preceding one only in that none of the searchers can see the intruder. The third model is a vertex-searching model in which searchers and an intruder move simultaneously and none of the searchers can see the intruder. The fourth model is simultaneous edge searching with an arbitrarily fast intruder.
Brief paper: H2 norm of linear time-periodic systems: A perturbation analysis
Authors: Mihailo R. Jovanović, Makan Fardad
Venue: Automatica (Journal of IFAC) (2008)

We consider a class of linear time-periodic systems in which the dynamical generator A(t) represents the sum of a stable time-invariant operator A"0 and a small-amplitude zero-mean T-periodic operator @eA"p(t). We employ a perturbation analysis to develop a computationally efficient method for determination of the H"2 norm. Up to second order in the perturbation parameter @e we show that: (a) the H"2 norm can be obtained from a conveniently coupled system of Lyapunov and Sylvester equations that are of the same dimension as A"0; (b) there is no coupling between different harmonics of A"p(t) in the expression for the H"2 norm. These two properties do not hold for arbitrary values of @e, and their derivation would not be possible if we tried to determine the H"2 norm directly without resorting to perturbation analysis. Our method is well suited for identification of the values of period T that lead to the largest increase/reduction of the H"2 norm. Two examples are provided to motivate the developments and illustrate the procedure.
Efficient configuration and control of sanets using facts
Authors: Kirsten Terfloth, Jochen Schiller
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

The utilization of domain-specific programming abstractions for wireless sensor actor networks can greatly ease application development. A high level of abstraction from underlying system complexity fosters fast prototyping and less erroneous source code. However, especially in this domain access to low-level parameters can be mandatory to allow for sophisticated application fine-tuning. In this paper, we present a layered system access interface we developed for our middleware platform FACTS to address this challenge. Context-based configuration and control of system-level resources is facilitated by relying on lean additions to the FACTS framework. These will be discussed with the help of a common use case to illustrate the simple, yet powerful abstraction provided.
Mathematical and numerical study of a corrosion model
Authors: Claire Chainais-Hillairet, Christian Bataillon
Venue: Numerische Mathematik (2008)

In this paper, we consider a PDE system arising in corrosion modelling. This system consists in two convection-diffusion equations on the densities of charge carriers and a Poisson equation on the electric potential. Boundary conditions are Robin boundary conditions. We discretize each equation by a finite volume scheme and we prove the convergence of the scheme towards a weak solution to the initial system. Finally, we provide numerical results describing the behaviour of the solutions with respect to an applied voltage.
Vortex methods for incompressible flow simulations on the GPU
Authors: Diego Rossinelli, Petros Koumoutsakos
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

We present a remeshed vortex particle method for incompressible flow simulations on GPUs. The particles are convected in a Lagrangian frame and are periodically reinitialized on a regular grid. The grid is used in addition to solve for the velocity&#x2013;vorticity Poisson equation and for the computation of the diffusion operators. In the present GPU implementation of particle methods, the remeshing and the solution of the Poisson equation rely on fast and efficient mesh-particle interpolations. We demonstrate that particle remeshing introduces minimal artificial dissipation, enables a faster computation of differential operators on particles over grid-free techniques and can be efficiently implemented on GPUs. The results demonstrate that, contrary to common practice in particle simulations, it is necessary to remesh the (vortex) particle locations in order to solve accurately the equations they discretize, without compromising the speed of the method. The present method leads to simulations of incompressible vortical flows on GPUs with unprecedented accuracy and efficiency.
Low-stress fabrication of 3D polymer free standing structures using lamination of photosensitive films
Authors: Patrick Abgrall, Samuel Charlot, Remy Fulcrand, Lefillastre Paul, Ali Boukabache, Anne-Marie Gu&#x00e9;
Venue: Microsystem Technologies (2008)

Free-standing microstructures such as cantilevers, membranes or microchannels are building blocks of microfluidic systems and MEMS. As a complement to silicon, the large family of polymers offers many opportunities for micro and nanotechnologies. Their low temperature processing and the planarizing properties of many resists is a definitive advantage for system integration, paving the way to complete lab-on-chips. In this article, we investigate a fabrication process of polymeric free standing structures based on the lamination of SU-8, a thick epoxy photoresist. Our motivation is the hybrid integration of polymer microfluidic or MEMS components with silicon chips (e.g., integrated circuits or sensors). Compared to rigid substrates used in more conventional SU-8/SU-8 bonding process, the flexible photosensitive films used within this lamination technique allows a more homogeneous and reliable bonding at low pressure and temperature, and a 3D fabrication with an excellent level-to-level alignment. A parametric optimization of the lamination process is presented. The fabrication of a leakage-free 3D microfluidic network is demonstrated by stacking up to five layers. A polyethylene terephtalate layer has been employed to easily release the SU-8 devices. We show that this release layer also significantly decrease the curvature of the substrate by 32% and the related residual stress in a 100&#x00a0;&#x03bc;m SU-8 layer by at least 10%. Finally, we briefly describe the hybrid integration of a silicon sensor in a microfluidic network as a direct application of our lamination process to the fabrication of lab-on-chips.
Separation Logic Semantics for Communicating Processes
Authors: Tony Hoare, Peter O'Hearn
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for separation in time as well as separation in space. It extends CSP in the direction of the pi-calculus: dynamic change of alphabet is achieved by communication of channel names. Separation is exploited to ensure that each channel still has only two ends. For purposes of exploration, the model is the simplest possible, confined to traces without refusals. The treatment is sufficiently general to facilitate extensions by standard techniques for sharing multiplexed channels and heap state.
ConPath: Scaffold Analysis Tool Using Mate-Pair Information for Genome Sequencing
Authors: Pan-Gyu Kim, Hwan-Gue Cho, Kiejung Park
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We have developed a Windows-based program, ConPath, as a scaffold analyzer which constructs scaffolds by ordering and orienting separate sequence contigs by exploiting the mate-pair information between contig-pairs. Our algorithm builds directed graphs from link information and traverses them to find out the longest acyclic graphs. Using end-read pairs of fixed-sized mate-pair library, ConPath determines relative orientations of all contigs, estimates the gap size of each adjacent contig pairs, and reports wrong assembly information by validating orientations and gap sizes. We have utilized ConPath in more than 10 microbial genome projects, including M. succiniciproducens [12] and V.vulinificus, where we have verified contig assembly by finding out some erroneous contigs with four kinds of error types defined in ConPath. It also supports some convenient features and viewers to investigate each contig in detail, like contig viewer, scaffold viewer, edge information list, mate-pair list, printing complex scaffolds structures, and so on.
Acceleration of the EM algorithm using the vector epsilon algorithm
Authors: Mingfeng Wang, Masahiro Kuroda, Michio Sakakihara, Zhi Geng
Venue: Computational Statistics (2008)

The expectation---maximization (EM) algorithm is a very general and popular iterative computational algorithm to find maximum likelihood estimates from incomplete data and broadly used to statistical analysis with missing data, because of its stability, flexibility and simplicity. However, it is often criticized that the convergence of the EM algorithm is slow. The various algorithms to accelerate the convergence of the EM algorithm have been proposed. The vector ¿ algorithm of Wynn (Math Comp 16:301---322, 1962) is used to accelerate the convergence of the EM algorithm in Kuroda and Sakakihara (Comput Stat Data Anal 51:1549---1561, 2006). In this paper, we provide the theoretical evaluation of the convergence of the ¿-accelerated EM algorithm. The ¿-accelerated EM algorithm does not use the information matrix but only uses the sequence of estimates obtained from iterations of the EM algorithm, and thus it keeps the flexibility and simplicity of the EM algorithm.
Minimum-delay energy-efficient source to multisink routing in wireless sensor networks
Authors: Shun-Yu Chuang, Chien Chen, Chang-Jie Jiang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

This paper proposes a simple and scalable approach to multisink routing scheme in wireless sensor networks. Wireless sensor network is a rapidly growing discipline, with new technologies emerging and new applications under development. In addition to providing light and temperature measurements, wireless sensor nodes have applications such as security surveillance, environmental monitoring, and wildlife watching. One potential problem in a sensor network is how to transmit packets efficiently from Single-Source to Multi-Sinks, i.e., to gather data from a single sensor node and to deliver it to multiple clients who are interested in the data. The difficulty of such a scenario is finding the minimum-cost multiple transmission paths. Many routing algorithms have been proposed to solve this problem. Most current algorithms address the reduction of power consumption, and potentially introduce a large delay. This paper proposes a novel multipath routing algorithm, called Hop-Count based routing (HCR) algorithm, which considers energy cost and transmission delay simultaneously. A hop count vector (HCV) is introduced to support routing decision. Moreover, an additional pruning vector (PV) can further enhance energy efficiency.
Construction of a Personalized Service Oriented Learning Resource Management System Framework
Authors: Zheng Hua
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Personalized service is a service model that provides service strategy and content varying from one user to another. The user is the center of personalized information service and only when we have acquired the user's demand, interest, fondness, and habits can we recommend the most valuable information to users. In this paper, we proposed a personalized service oriented learning resource management system (PSOLRMS) model. This framework can provide the users several personalized services, such as personalized content recommendation, personalized content search and personalized content presentation. The emphasis of this paper is to propose the key technologies of how to realize the personalized content filtering.
Cooperation between developers and operations in software engineering projects
Authors: Bjørnar Tessem, Jon Iden
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

In this paper we discuss how the cooperation between developers and operations staff is practiced. We have analyzed data collected from a focus group of experienced software engineers and project managers, as well as interviews from two case studies. Our position is that well performed cooperation between the development team and the operations team is crucial for successful deployment and operations of a new or extensively revised software system. The data shows that cooperation can be improved in several development activities like requirements engineering, system design, documentation, testing, training, and deployment planning. Likely consequences of poor cooperation in these activities are lower productivity in development and operations, as well as unsatisfied users.
Note: Tight bounds for break minimization in tournament scheduling
Authors: Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger
Venue: Journal of Combinatorial Theory Series A (2008)

We consider round-robin sports tournaments with n teams and n-1 rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least 14n(n-2) breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.
Implementation of Traffic Lights in JUTS
Authors: Richard Lipka, Pavel Herout
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper describes behaviour and implementation of light signalization in urban traffic simulator JUTS. Traffic lights are necessary part of urban traffic network and they allow using JUTS in experiments dealing with impact of time plans to traffic situation.
Shellable graphs and sequentially Cohen--Macaulay bipartite graphs
Authors: Adam Van Tuyl, Rafael H. Villarreal
Venue: Journal of Combinatorial Theory Series A (2008)

Associated to a simple undirected graph G is a simplicial complex @D"G whose faces correspond to the independent sets of G. We call a graph G shellable if @D"G is a shellable simplicial complex in the non-pure sense of Bjorner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give a recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.
The Application and Research of Ontology Construction Technology
Authors: Wenwen Yi, Yong Sun, Shukui Zhang, Yingfeng Wu, Zhenhua Chu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

In the field of search, the application of ontology is an important research topic. Introduction of ontology technology in the Retrieval System with massive data can make the searching results more comprehensive. However, now days the ontology is constructed by domain experts, and there are a lot of shortcomings, such as complex process, long time for the project, and difficulty to update. Thereby, in this paper, a method of semiautomaticly building ontology is proposed, after synthetically analyzing a variety of methods and techniques about it. The building process which is based on user interests, mines not only the concepts but also the potential relationships between concepts from the texts by the method of concepts clustering. On the basis of such research, an unique Patent Information Retrieval System based on ontology has been completed.
Proceedings of the 7th international symposium on Memory management
Venue: International Symposium on Memory Management (2008)

It is with great pleasure that we welcome you to the 2008 International Symposium on Memory Management. This year's symposium continues ISMM's tradition as the top venue for the presentation of research results on memory management, and is the second since ISMM switched to an annual format. The sixteen papers selected for ISMM'08 cover diverse and interesting aspects of memory management. We used a double blind reviewing process, which worked smoothly and efficiently. In an effort to increase the breadth of the reviewer pool and depth of reviewer expertise, this year we used a "review committee" (RC) for the first time. The RC provided expert reviews, but was established ahead of time, rather than on an ad-hoc basis. Unlike the program committee, the RC did not attend the PC meeting, so did not contribute to that aspect of the editorial process. Each paper received 3 PC reviews and 1 RC review. We were very happy with how well this worked. We also used the author response mechanism again this year. The program committee were given 30 minutes at the start of the PC meeting to re-read every author response. As each paper was discussed, the discussion leader commented briefly on the author response. The authors' response directly impacted the outcome for a number of papers.
A Model-Theoretic Analysis Of Knowledge: Preliminary Report
Authors: R. Fagin
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Understanding knowledge is a fundamental issue in many disciplines. In computer science, knowledge arises not only in the obvious contexts (such as knowledge-based systems), but also in distributed systems (where the goal is to have each processor "know" something, as in Byzantine agreement). A general semantic model of knowledge is introduced, to allow reasoning about statements such as "He knows that I know whether or not she knows whether or not it is raining." This approach more naturally models a state of knowledge than previous proposals (including Kripke structures). Using this notion of model, a model theory for knowledge is developed. This theory enables one to interpret such notions as a "finite amount of information" and "common knowledge" in different contexts.