ppxscal/embedding_network huggingface dataset:
Semantic vs. syntactic compositions in aspect-oriented requirements engineering: an empirical study
Authors: Ruzanna Chitchyan, Phil Greenwood, Americo Sampaio, Awais Rashid, Alessandro Garcia, Lyrene Fernandes da Silva
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Most current aspect composition mechanisms rely on syntactic references to the base modules or wildcard mechanisms quantifying over such syntactic references in pointcut expressions. This leads to the well-known problem of pointcut fragility. Semantics-based composition mechanisms aim to alleviate such fragility by focusing on the meaning and intention of the composition hence avoiding strong syntactic dependencies on the base modules. However, to date, there are no empirical studies validating whether semantics based composition mechanisms are indeed more expressive and less fragile compared to their syntax-based counterparts. In this paper we present a first study comparing semantics- and syntax-based composition mechanisms in aspect-oriented requirements engineering (AORE). In our empirical study the semantics-based compositions examined were found to be indeed more expressive and less fragile. The semantics-based compositions in the study also required one to reason about composition interdependencies early on hence potentially reducing the overhead of revisions arising from later trade-off analysis and stakeholder negotiations. However, this added to the overhead of specifying the compositions themselves. Furthermore, since the semantics-based compositions considered in the study were based on natural language analysis, they required initial effort investment into lexicon building as well as strongly depended on advanced tool support to expose the natural language semantics.
Impact of QoS on Internet User Welfare
Authors: Galina Schwartz, Nikhil Shetty, Jean Walrand
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In this paper, we investigate the welfare effects of transition from a single-service class to two-service classes in the Internet. We consider an ISP who offers network access to a fixed user base, consisting of users who differ in their quality requirements and willingness to pay for the access. We model user-ISP interactions as a game in which the ISP makes capacity and pricing decisions to maximize his profits and the users only decide which service to buy, if any. Our model provides robust pricing for networks with single- and two-service classes. Our results indicate that transition to multiple service classes is socially desirable, but could be blocked due to the unfavorable distributional consequences that it inflicts on the existing network users. To facilitate the transition, we propose a simple regulatory tool that alleviates the political economic constraints and thus makes the transition feasible.
A study on the process model for IT service management
Authors: Chen Zhao, HongHua Gan, Fei Gao
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

The article proposes a process model for designing, developing and deploying business solutions, primary deals with IT Service Management (ITSM) and IT Infrastructure Library (ITIL), as a process based method. To develop an architecture for information technology service management and design process solutions, it is necessary to establish a common framework for delivering IT services. The model is a framework for organizing the assets that constitute an ITSM design. Using this framework, an organization can document the available set of IT services offered and understand how they are composed from finer-grained services delivered by internal or external providers. This process model can be used by management software vendors to describe the capabilities of their ITSM offerings and to align those with the needs of different customers.
Optimizing NC-tool paths for simultaneous five-axis milling based on multi-population multi-objective evolutionary algorithms
Authors: Petra Kersting, Andreas Zabel
Venue: Advances in Engineering Software (2009)

Computer-Numerical-Control based five-axis milling offers new possibilities for improving the machining process. However, this procedure is still difficult to handle, particularly in case of machining complex free-formed surfaces. An optimization approach based on the multi-objective evolutionary algorithm SMS-EMOA (S-metric selection evolutionary multi-objective optimization algorithm) combined with a multi-population approach has been developed and used in order to utilize the potential of the five-axis milling process. After a general introduction to this machining process and the potential of path optimization, the designed multi-population multi-objective evolutionary approach, its integration into the simulation, and its adaptation to the practical example is described.
Schema-conscious filtering of XML documents
Authors: Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stream of XML documents and delivers to subscribers a notification or content of documents that match the profiles. For filtering with profiles expressed as linear XPath queries, automaton-based approaches exist where the intractable size growth of a preconstructed deterministic finite automaton is avoided by using a nondeterministic automaton. In this article we examine how these general approaches, which do not assume the existence of any specific schema or document type definition (DTD), might benefit from the knowledge that all the XML documents to be filtered obey a given DTD. We present an algorithm that utilizes the DTD in the preprocessing phase of the filtering automaton to prune out descendant operators (//) and wildcards (*) from the linear XPath filters. Experiments with data obtained from the XML Data Repository of the Univ. of Washington indicate that filter pruning can increase the throughput of the nondeterministic YFilter automaton by Diao et al. by a factor of 2 to 20. We also present a new filtering algorithm that is based on a backtracking deterministic finite automaton derived from the classic Aho--Corasick pattern-matching automaton. This automaton has a size linear in the sum of the sizes of the filters. For our algorithm, we obtained a throughput of 15 MB/sec for filters pruned from one million original filters (with all wildcards and non-leading descendant operators eliminated), representing an improvement by a factor of 2 to 3 upon the throughput of YFilter.
Cool URIs for the DDC: towards web-scale accessibility of a large classification system
Authors: Michael Panzer
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The report discusses metadata strategies employed and problems encountered during the first step of transforming the DDC into a Web information resource. It focuses on the process of URI design, with regard to W3C recommendations and Semantic Web paradigms. Special emphasis is placed on usefulness of the URIs for RESTful web services.
The Communication Systems Based on an Enhanced VWDK Technique: Performance Analysis and the Application on Amplitude Modulation
Authors: Zhang Yu, Zhu Songsheng, Yin Kuixi
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Developing high efficient modulation technique has played an important role in the field of communication. In recent years, various modulation techniques have being brought out. The technique of ultra narrow bandwidth, with high efficiency in bandwidth and high suppression to sidebands as the main highlights, has developed particularly rapidly. This paper modifies the very-minimum waveform difference keying (VWDK), which is a key technique in ultra narrow bandwidth, proposes a new expression of waveform, which has higher efficiency, and applies it in traditional amplitude modulation systems. The new systems combing with VWDK and amplitude modulation can transmit the analog signals with high speed digital signals by the carriers.
An adaptive personalized E-learning model based on agent technology
Authors: Zhen Liu, Yuying Liu
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

Due to overall popularity of the Internet, E-learning has become a lot methods of learning in recent years. Through the Internet, learners can freely absorb new knowledge without the restriction of time and place. Based on individual difference of learner's abilities and preferred learning styles in hypermedia environment, the learning outcomes vary essentially. Meanwhile, with the development of E-learning technologies, learners can be provided more effective learning environment to optimize their learning. Adaptive E-learning systems are built to personalize and adapt E-learning content, pedagogical models, and interactions between participants in the environment to meet the individual needs and preferences of users if and when they arise. In our paper, we first explain the grid agent E-learning model, whose main actions including registry, directory and discovery. Through these actions, the manager's agent will find out the suitable learning services. Secondly, to implement the adaptability of the grid agent model, the method of Artificial Psychology and how to realize adaptive personalized E-learning by this method so that are the student's agent can employ the learning material matched to their own personality type are also emphasized. The experiment data also supported our assumption that the learners may perform better if they use our adaptive grid agent model.
A framework for implementing TISIT model to integrate TQM with software and information technologies
Authors: N. Gunasekaran, V. P. Arunachalam, S. Arunachalam
Venue: International Journal of Information Technology and Management (2009)

This paper proposes a framework for implementing a model called Total Quality Management (TQM) Integrated with Software and Information Technologies (TISIT), which integrates the TQM foundations with the software and Information Technologies (IT). This framework enables the organisations to reduce or eliminate the gaps which are created due to the customer expectations and the actual deliveries. An algorithm has been designed, developed and validated with a case study on implementing TISIT. A generic framework is found and useful to improve the quality on continual basis in any organisation. The flexibility of this framework is that one could start from any stage as they like and continue the cycle of implementation.
Modeling of inelastic behavior of curved members with a mixed formulation beam element
Authors: Afsin Saritas
Venue: Finite Elements in Analysis and Design (2009)

The curved beam element in this paper is based on Hu-Washizu variational principle. The nonlinear response of the element arises from the integration of stress-strain relations over several control sections along the element length. The finite element approximation for the beam uses shape functions for stress resultants that satisfy equilibrium and discontinuous strains along the beam. No approximation for the beam displacement field is necessary in the formulation. The proposed element is free from membrane and shear locking. Examples verify the superior performance of the model under linear and nonlinear material conditions.
Backdoor Sets of Quantified Boolean Formulas
Authors: Marko Samer, Stefan Szeider
Venue: Journal of Automated Reasoning (2009)

We generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas (QBF). This allows us to obtain hierarchies of tractable classes of quantified Boolean formulas with the classes of quantified Horn and quantified 2CNF formulas, respectively, at their first level, thus gradually generalizing these two important tractable classes. In contrast to known tractable classes based on bounded treewidth, the number of quantifier alternations of our classes is unbounded. As a side product of our considerations we develop a theory of variable dependency which is of independent interest.
An Abort-Aware Model of Transactional Programming
Authors: Kousha Etessami, Patrice Godefroid
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better exploit the parallelism of modern multi-processor machines, such as multi-core microprocessors. We introduce Transactional State Machines (TSMs) as an abstract finite-data model of transactional shared-memory concurrent programs. TSMs are a variant of concurrent boolean programs (or concurrent extended recursive state machines) augmented with additional constructs for specifying potentially nested transactions. Namely, some procedures (or code segments) can be marked as transactions and are meant to be executed "atomically", and there are also explicit commit and abort operations for transactions. The TSM model is non-blocking and allows interleaved executions where multiple processes can simultaneously be executing inside transactions. It also allows nested transactions, transactions which may never terminate, and transactions which may be aborted explicitly, or aborted automatically by the run-time environment due to memory conflicts. We show that concurrent executions of TSMs satisfy a correctness criterion closely related to serializability, which we call stutter-serializability, with respect to shared memory. We initiate a study of model checking problems for TSMs. Model checking arbitrary TSMs is easily seen to be undecidable, but we show it is decidable in the following case: when recursion is exclusively used inside transactions in all (but one) of the processes, we show that model checking such TSMs against all stutter-invariant &omega;-regular properties of shared memory is decidable.
mixiTUI: a tangible sequencer for electronic live performances
Authors: Esben Warming Pedersen, Kasper Hornbæk
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Tangible user interfaces for manipulating audio and music focus mostly on generating music on the spot, but rarely on how electronic musicians balance preparation and improvisation in staging live performances or on how the audience perceives the performances. We present mixiTUI, a tangible sequencer that allows electronic musicians to import and perform electronic music. mixiTUI is developed in collaboration with electronic musicians, with a focus on live arranging, on visualizations of music, on tokens that represent key elements in live performances, and on how the audience experiences the tangible interface. We present an evaluation of mixiTUI in a concert with 117 participants and argue that mixiTUI improves both the audience's and the musician's experience.
Designers wanted: participation and the user experience in open source software development
Authors: Paula M. Bach, Robert DeLine, John M. Carroll
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present design concepts and related mockups that support the user experience for projects hosted on CodePlex, an open source project hosting website. Rationale for the design concepts is grounded in the open source literature and a thirteen-week study with the CodePlex team. We propose that fostering ways to build trust, providing opportunities for merit, supporting crossover of work activities, and supporting user experience (UX) best practices in CodePlex will help dismantle the social and technological barriers for UX and encourage UX designer participation. We address UX designer motivation as a challenge for participation and conclude that the mockups presented are a first step in furthering the user experience in open source software development.
Identity-Based Encryptions with Tight Security Reductions to the BDH Problem
Authors: Mototsugu Nishioka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We present IND-ID-CPA secure identity-based encryption (IBE) schemes with tight reductions to the bilinear Diffie-Hellman (BDH) problem. Since the methods for obtaining IND-ID-CCA secure schemes from IND-ID-CPA secure schemes with tight reductions are already known, we can consequently obtain IND-ID-CCA secure schemes with tight reductions to the BDH problem. Our constructions are based on IBE schemes with tight reductions to the list bilinear Diffie-Hellman (LBDH) problem, and the schemes are converted to those with tight reductions to the BDH problem. Interestingly, it can be shown that there exists a black box construction, in which the former IBE schemes are given as black boxes. Our constructions are very simple and reasonably efficient.
Minimizing interference in satellite communications using transiently chaotic neural networks
Authors: Wen Liu, Lipo Wang
Venue: Computers Mathematics with Applications (2009)

The frequency assignment problem (FAP) in satellite communications is solved with transiently chaotic neural networks (TCNN). The objective of this optimization problem is to minimize cochannel interference between two satellite systems by rearranging the frequency assignments. For an N-carrier-M-segment FAP problem, we construct a TCNN consisting of NxM neurons. The performance of the TCNN is demonstrated through solving a set of benchmark problems, where the TCNN finds comparative if not better solutions as compared to the existing algorithms.
Array like runtime reconfigurable MIMO detectors for 802.11n WLAN: a design case study
Authors: Pankaj Bhagawat, Rajballav Dash, Gwan Choi
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Future high speed wireless standards such as 802.11n involve Multiple Input Multiple Output (MIMO) antenna systems as a key technology component. Efficient design of the MIMO detector is a challenging task. This is further compounded by the fact that 802.11n standard requires support for runtime switching between different modulation schemes (or modes). While searching for an appropriate architecture attention must be paid to application requirements such as required throughput, limits on latency, and reconfiguration between various modes of operations. Important hardware design metrics such as area/power should be optimized over all the operating modes of the detector. In this paper we carry out extensive architectural space exploration to address the issues of power consumption, area, and reconfigurability between different modes of operation while meeting the standards throughput requirement. Ultimately, we come up with two designs that target low area and low power respectively. We also maintain close to optimum Bit Error Rate(BER), which is vital for any wireless system. The design estimates are based on 45nm technology library.
Biased Random Walks in Uniform Wireless Networks
Authors: Roberto Beraldi
Venue: IEEE Transactions on Mobile Computing (2009)

A recurrent problem when designing distributed applications is to search for a node with known property. File searching in peer-to-peer (P2P) applications, resource discovery in service-oriented architectures (SOAs), and path discovery in routing can all be cast as a search problem. Random walk-based search algorithms are often suggested for tackling the search problem, especially in very dynamic systems-like mobile wireless networks. The cost and the effectiveness of a random walk-based search algorithm are measured by the excepted number of transmissions required before hitting the target. Hence, to have a low hitting time is a critical goal. This paper studies the effect of biasing random walk toward the target on the hitting time. For a walk running over a network with uniform node distribution, a simple upper bound that connects the hitting time to the bias level is obtained. The key result is that even a modest bias level is able to reduce the hitting time significantly. This paper also proposes a search protocol for mobile wireless networks, whose results are interpreted in the light of the theoretical study. The proposed solution is for unstructured wireless mobile networks.
Color-Based Image Retrieval Using Spatial-Chromatic Histograms
Authors: L. Cinque, S. Levialdi, A. Pellicano, K. A. Olsen
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We propose a methodology to integrate color and spatial information for content-based image retrieval. This methodology, called Spatial-Chromatic Histogram (SCH), synthesizes in few values information about the location of pixels having the same color and their arrangement within the image. We have performed experiments on a three hundred images database and our results show a high retrieval accuracy.
Partial Polymorphisms and Constraint Satisfaction Problems
Authors: Henning Schnoor, Ilka Schnoor
Venue: Complexity of Constraints: An Overview of Current Research Themes (2008)

The Galois connection between clones and and co-clones has received a lot of attention in the context of complexity considerations for constraint satisfaction problems. However, it fails if we are interested in a reduction giving equivalence instead of only satisfiability-equivalence. We show how a similar Galois connection involving weaker closure operators can be applied for these problems. As an example of the usefulness of our construction, we show how to obtain very short proofs of complexity classifications in this context.
Astrophysical image separation by blind time--frequency source separation methods
Authors: Mehmet Tankut Özgen, Ercan Engin Kuruoğlu, Diego Herranz
Venue: Digital Signal Processing (2009)

In this paper, two prevalent blind time-frequency (TF) source separation methods in the literature are adapted to astrophysical image mixtures and four algorithms are developed to separate them into their astrophysical components. The components considered in this work are cosmic microwave background (CMB) radiation, galactic dust and synchrotron, among which the CMB component is emphasized. These simulated components mixed via realistic coefficients are subjected to simulated additive, nonstationary Gaussian noise components of realistic power levels, to yield image mixtures on which our orthogonal and nonorthogonal TF algorithms are applied. The developed algorithms are compared with the FastICA algorithm and CMB component is found to be recovered with an improvement reaching to 3.25 decibels from CMB-synchrotron mixtures. The proposed techniques are believed to be generically applicable in separating other types of astrophysical components as well.