ppxscal/embedding_network huggingface dataset:
A graph-transformation-based simulation approach for analysing aspect interference on shared join points
Authors: Mehmet Aksit, Arend Rensink, Tom Staijen
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Aspects that in isolation behave correctly, may interact when being combined. When interaction changes an aspect's behaviour or disables an aspect, we call this interference. One particular type of interference occurs when aspects are applied to shared join points, since then the ordering of the aspects can also influence the behaviour of the composition. We present an approach to detect aspect interference at shared join points. Aspect compositions are modelled by using a graph production system for modelling aspect-language semantics. A graph-based model of a join point is generated from the source-code of the system. This graph is transformed into a runtime-state representation. Combined with the production system (and the correct tooling) the execution of the aspects is simulated. This simulation results in a labelled transition system that can be used to analyse and verify different properties of the system at the join point. Simulation of the entire system can be computationally expensive. In our approach, we decide to abstract base system execution into non-deterministic valuation and carefully choosing advice semantics, such that simulation of the entire system can be avoided.
RF and microwave mixer behavioural modelling
Authors: F. J. Casas, N. Garmendia, J. Portilla
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Efficient models based on behavioural modelling techniques are needed for RF and microwave mixers in order to check the performances of communication systems. Here, we propose a model consisting on the cascade connection of an input equivalent filter, characterising the linear transmission and reflection memory effects, and an ideal nonlinear mixer model, providing the frequency translation and also the nonlinear amplitude and phase distortion for the central frequency. Model parameters can be obtained either from measurements or simulations of the mixer circuit. The reported models can be implemented in any commercial simulator by using standard library components and can be employed both in frequency and time-domain simulations, demonstrating good agreement and significant reduction of simulation time with respect to the simulation of detailed electrical circuit models. The modelling technique is illustrated through two WLAN IEEE 802.11a mixer examples: an up-converter and a down-converter.
A joint multi-country, multi-culture and multi-disciplinary master programme on software engineering plus X
Authors: Xiaofei Xu, Haifeng Li, Weihua Guo
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

Facing the challenge of the new globalization tendency of international industry especially the IT and software industry, universities keep make great efforts to provide the so-called "T-Shape" people to fulfill the demand of industry. This paper introduces a novel joint Master programme which aims at establishing an international education system and platform. It offers for education in software engineering plus a special familiarity in an application domain such as services in enterprises, production engineering, information technology, computer network systems, etc. Students graduate from this programme, will be equipped with multi-ability in multi-discipline, familiar with multiple cultures and traditions, and with studying and working experiences in multiple countries. The schema, the characteristics, the execution principles are discussed wishing to share our practice and experience with our education colleagues.
A Research on QoS-based Ontology Model for Web Services Discovery
Authors: Hui Zhang, Weiying Gao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The existing Web services lack of support of formal semantics obviously, so Web services discovery is difficult for users to select the best service because of lacking description for quality of service (QoS), therefore, this paper presents a QoS-based ontology model for Web services discovery, and the model uses classification and feedback mechanisms which can add QoS ontology information in the process of services discovery. We also give the based-ontology algorithm for matching semantic web services. Compared with the existing methods，the method improves the performance of web services discovery effectively, and enhances the validity for users to find the best services.
Website quality: a prerequisite to addressing citizen expectations in e-governance
Authors: S. L. Sarnot, U. K. Nandwani, R. P. Sondhi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

A large number of government websites have been set up in India over the last few years to deliver a wide variety of information and services to its citizens. The concepts of quality and security for a website need to be quantified in some way to avoid subjective interpretations. The authors have prepared a framework and a website quality certification scheme primarily based upon international best practices. This paper elucidates the framework and modus operandi to assure quality of the websites in e-Governance gamut.
Stream Sequential Pattern Mining with Precise Error Bounds
Authors: Luiz F. Mendes, Bolin Ding, Jiawei Han
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recent years, emerging applications have introduced a new form of data called data stream. In a data stream, new elements are generated continuously. This poses additional constraints on the methods used for mining such data: memory usage is restricted, the infinitely flowing original dataset cannot be scanned multiple times, and current results should be available on demand.This paper introduces two effective methods for mining sequential patterns from data streams: the SS-BE method and the SS-MB method. The proposed methods break the stream into batches and only process each batch once. The two methods use different pruning strategies that restrict the memory usage but can still guarantee that all true sequential patterns are output at the end of any batch. Both algorithms scale linearly in execution time as the number of sequences grows, making them effective methods for sequential pattern mining in data streams. The experimental results also show that our methods are very accurate in that only a small fraction of the patterns that are output are false positives. Even for these false positives, SS-BE guarantees that their true support is above a pre-defined threshold.
Note: The dimensions of LU(3,q) codes
Authors: Ogul Arslan
Venue: Journal of Combinatorial Theory Series A (2009)

A family of LDPC codes, called LU(3,q) codes, has been constructed from q-regular bipartite graphs. Recently, P. Sin and Q. Xiang determined the dimensions of these codes in the case that q is a power of an odd prime. They also obtained a lower bound for the dimension of an LU(3,q) code when q is a power of 2. In this paper we prove that this lower bound is the exact dimension of the LU(3,q) code. The proof involves the geometry of symplectic generalized quadrangles, the representation theory of Sp(4,q), and the ring of polynomials.
Natural facial expression recognition using differential-AAM and manifold learning
Authors: Yeongjae Cheon, Daijin Kim
Venue: Pattern Recognition (2009)

This paper proposes a novel natural facial expression recognition method that recognizes a sequence of dynamic facial expression images using the differential active appearance model (AAM) and manifold learning as follows. First, the differential-AAM features (DAFs) are computed by the difference of the AAM parameters between an input face image and a reference (neutral expression) face image. Second, manifold learning embeds the DAFs on the smooth and continuous feature space. Third, the input facial expression is recognized through two steps: (1) computing the distances between the input image sequence and gallery image sequences using directed Hausdorff distance (DHD) and (2) selecting the expression by a majority voting of k-nearest neighbors (k-NN) sequences in the gallery. The DAFs are robust and efficient for the facial expression analysis due to the elimination of the inter-person, camera, and illumination variations. Since the DAFs treat the neutral expression image as the reference image, the neutral expression image must be found effectively. This is done via the differential facial expression probability density model (DFEPDM) using the kernel density approximation of the positively directional DAFs changing from neutral to angry (happy, surprised) and negatively directional DAFs changing from angry (happy, surprised) to neutral. Then, a face image is considered to be the neutral expression if it has the maximum DFEPDM in the input sequences. Experimental results show that (1) the DAFs improve the facial expression recognition performance over conventional AAM features by 20% and (2) the sequence-based k-NN classifier provides a 95% facial expression recognition performance on the facial expression database (FED06).
Commentary: A Trip Without a Roadmap
Authors: Peter Christy
Venue: Queue (2009)

Instead of simply imagining what your users want or need, it's always a good idea to first get their input.
A concurrency control algorithm in a distributed environment
Authors: Paul Decitre
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

As a continuation of the POLYPHEME study, the Cii-Honeywell Bull research center has launched a project on co-operating transactional systems with particular attention paid to distributed concurrency control and commitment. Following the presentation of the application-driven approach being taken, the distributed concurrency control algorithm is described as an improvement of the proposal made by Rosenkrantz, Stearns and Lewis. Salient technical features such as deadlock prevention, wrong aborts, parallel execution, and relation between concurrency control and commitment are detailed. Then the main choices are justified, and the rejected techniques criticized.
System Issues in Digital Image and Video Watermarking for Copy Protection
Authors: Ton Kalker
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Watermarking is an emerging technology that is claimed to have an important application in copyright protection. We argue that in many cases still-image watermarks cannot live up to this expectation. We show that the situation is different for video, mainly due to the sheer volume of the data. An overview is given of an important application for video watermarking, viz. DVD copy protection. Finally, we make the case that a total system solution needs more ingredients than watermarking alone.
QoS Requirements for a Medical Application on the Grid
Authors: Reda Albodour, Anne James, Norlaily Yaacob, Anthony Godwin
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Grid Computing provides the infrastructure needed to access and benefit from distributed resources through Virtual Organizations. Grids will be a vital part in the execution of applications, such as complex simulations. They will also carry applications that need large computational power. Such Grids are called computational Grids. Some applications on the Grid will expect benefit from services that might be time or content specific and will therefore need to adhere to a strict set of guidelines for their operation. These guidelines are referred to as Qualities of Services (QoS). Even though they were extensively researched for Web Services, there is still much work to be done to implement QoS on Grid Services. The aim of this paper is to explain what QoS are vital for a Grid Service, how they would enhance its operation and how they are to be delivered and guaranteed. This is achieved through the exploration of a case study in which QoS requirements are analysed. A framework is then presented which supports delivery of Grid QoS.
On the time-splitting scheme used in the Princeton Ocean Model
Authors: V. M. Kamenkovich, D. A. Nechaev
Venue: Journal of Computational Physics (2009)

The analysis of the time-splitting procedure implemented in the Princeton Ocean Model (POM) is presented. The time-splitting procedure uses different time steps to describe the evolution of interacting fast and slow propagating modes. In the general case the exact separation of the fast and slow modes is not possible. The main idea of the analyzed procedure is to split the system of primitive equations into two systems of equations for interacting external and internal modes. By definition, the internal mode varies slowly and the crux of the problem is to determine the proper filter, which excludes the fast component of the external mode variables in the relevant equations. The objective of this paper is to examine properties of the POM time-splitting procedure applied to equations governing the simplest linear non-rotating two-layer model of constant depth. The simplicity of the model makes it possible to study these properties analytically. First, the time-split system of differential equations is examined for two types of the determination of the slow component based on an asymptotic approach or time-averaging. Second, the differential-difference scheme is developed and some criteria of its stability are discussed for centered, forward, or backward time-averaging of the external mode variables. Finally, the stability of the POM time-splitting schemes with centered and forward time-averaging is analyzed. The effect of the Asselin filter on solutions of the considered schemes is studied. It is assumed that questions arising in the analysis of the simplest model are inherent in the general model as well.
Redundant via insertion with wire bending
Authors: Kuang-Yao Lee, Shing-Tung Lin, Ting-Chi Wang
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Redundant via insertion is highly recommended for improving chip yield and reliability. In this paper, we study the problem of double via insertion with wire bending (DVI/WB) in a post-routing stage, where a single via can have at most one redundant via inserted next to it. Aside from this, we are allowed to bend existing signal wires for enhancing the insertion rate of double vias. The goal of DVI/WB is to primarily insert as many double vias as possible and to minimize the amount of layout perturbation as the secondary objective. We formulate the DVI/WB problem as that of finding a minimum-weight maximum independent set (mWMIS) on an enhanced conflict graph. We propose algorithms to perform wire bending and to construct the enhanced conflict graph from a given design. Moreover, we also propose a zero-one integer linear program (0-1 ILP) based approach to solve mWMIS. Experimental results show that our approach can improve the insertion rate by up to 5.58% at the expense of up to 0.37% wirelengh increase when compared with a state-of-the-art double via insertion method that does not consider wire bending.
Sequential Simulated Annealing System for Pattern Detection
Authors: Kou-Yuan Huang, Ying-Liang Chou
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Asequential system is proposed by using simulated annealing for the detection of lines, circles, ellipses, and hyperbolas in image. The sequential detection procedures are type by type and patterns by patterns. The equation of ellipse and hyperbola is defined under translation and rotation. The distance from all points to all patterns is defined as the error. Using simulated annealing for parameter detection can search a set of parameter vectors for the global minimal error. We also propose synchronous simulated annealing detection system to compare with sequential system. In the experiments, using the sequential system, the result of a large number of simulated and real image patterns detection is better than that of using the synchronous system.
A Novel Approach to Identification of Speakers from Their Hum
Authors: Hemant A. Patil, Prakhar Kant Jain, Robin Jain
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Automatic Speaker Recognition (ASR) deals with identification speakers with the help of machine from their voice. An ASR system will be efficient if the proper speaker-speciﬁc features are extracted. Most of the state-of-the-art ASR systems use the natural speech signal (either read speech or spontaneous or contextual speech) from the subjects. In this paper, an attempt is made to identify speakers from their hum. The experiments are shown for Linear Prediction Coefficients (LPC), Linear Prediction Cepstral Coefficients (LPCC), and Mel Frequency Cepstral Coefficients (MFCC) as input feature vectors to the polynomial classiﬁer of 2nd and 3rd order approximation. Results are found to be better for MFCC than LP-based features.
Semiautomatic Transfer Function Initialization for Abdominal Visualization Using Self-Generating Hierarchical Radial Basis Function Networks
Authors: M. Alper Selver, Cüneyt Güzeliş
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

Being a tool that assigns optical parameters used in interactive visualization, Transfer Functions (TF) have important effects on the quality of volume rendered medical images. Unfortunately, finding accurate TFs is a tedious and time consuming task because of the trade off between using extensive search spaces and fulfilling the physician's expectations with interactive data exploration tools and interfaces. By addressing this problem, we introduce a semi-automatic method for initial generation of TFs. The proposed method uses a Self Generating Hierarchical Radial Basis Function Network to determine the lobes of a Volume Histogram Stack (VHS) which is introduced as a new domain by aligning the histograms of slices of a image series. The new self generating hierarchical design strategy allows the recognition of suppressed lobes corresponding to suppressed tissues and representation of the overlapping regions which are parts of the lobes but can not be represented by the Gaussian bases in VHS. Moreover, approximation with a minimum set of basis functions provides the possibility of selecting and adjusting suitable units to optimize the TF. Applications on different CT/MR data sets show enhanced rendering quality and reduced optimization time in abdominal studies.
A spiking neural network model of an actor-critic learning agent
Authors: Wiebke Potjans, Abigail Morrison, Markus Diesmann
Venue: Neural Computation (2009)

The ability to adapt behavior to maximize reward as a result of interactions with the environment is crucial for the survival of any higher organism. In the framework of reinforcement learning, temporal-difference learning algorithms provide an effective strategy for such goal-directed adaptation, but it is unclear to what extent these algorithms are compatible with neural computation. In this article, we present a spiking neural network model that implements actor-critic temporal-difference learning by combining local plasticity rules with a global reward signal. The network is capable of solving a nontrivial gridworld task with sparse rewards. We derive a quantitative mapping of plasticity parameters and synaptic weights to the corresponding variables in the standard algorithmic formulation and demonstrate that the network learns with a similar speed to its discrete time counterpart and attains the same equilibrium performance.
Application of the massively parallel processor to database management systems
Authors: Edward W. Davis
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The Goodyear massively parallel processor (MPP) represents a new architecture with the potential for providing improved solutions to applications benefiting from highly parallel operation. In this paper, application of the MPP to database management systems is examined. Specifically, the relational database model is considered. Database management has been selected as a candidate application of the MPP because of the positive results achieved in previous work related to parallel architectures and database systems. The relational model has been selected for its applicability to parallel processing, its mathematical foundation, and its general recognition as a model that is superior in many respects to the hierarchical and network models. The paper concentrates on a comparative evaluation of the MPP and an abstract conventional computer by examining specific database management functions rather than an entire database management system.