ppxscal/embedding_network huggingface dataset:
Mining early aspects from requirements with ea-miner
Authors: Américo Sampaio, Awais Rashid
Venue: Companion of the 30th international conference on Software engineering (2008)

Aspect-Oriented Requirements Engineering (AORE) aims at bringing the benefits achieved by separation of concerns (e.g., improved modularity, reusability and maintainability) to requirements engineering. In order to cope with costly tasks performed during AORE such as identifying concerns and structuring requirements in different models, tool support is vital to effectively reduce the burden of performing these various tasks. This demonstration describes how the EA-Miner tool provides automated support, based on natural language processing techniques, for mining various types of concerns from a variety of early stage requirements documents. The tool is implemented as an Eclipse plug-in and enables several features such as visualizing and editing the models and generating specification documents.
Computers in Music Education: Amplifying Musicality
Authors: Andrew Brown
Venue:  (2007)

Computers in Music Education addresses the question of how computer technologies might best assist music education. For current and preservice music teachers and designed as a development tool, reference resource, and basic teaching text, it addresses pedagogical issues and the use of computers to aid production and presentation of students musical works.Written by a music educator and digital media specialist, it cuts through the jargon to present a concise, easy-to-digest overview of the field, covering:notation softwareMIDI sound creationdownloading musicposting personal MP3s for mass distribution.While there are many more technical books, few offer a comprehensive, understandable overview of the field. Computers in Music Education is an important text for the growing number of courses in this area.
On The Evolution Of Reliability Methods For Critical Software
Authors: María del Mar Gallardo, Jesús Martínez, Pedro Merino, Ernesto Pimentel
Venue: Journal of Integrated Design Process Science (2006)

The dream of software developers is a debugging tool that automatically finds all the potential errors in a quite readable and easy-to-locate format. In particular, this is sought desired by developers of concurrent programs for critical systems, such as control or communication systems. The unpredictable nature of this software and its large amount of potential behaviors makes it very prone to errors. Fortunately, the development of verification techniques during the last 20 years currently has motivated promising projects to obtain powerful tools. This paper summarizes the view of the past evolution and the current trend in this field.
Data mining techniques for better decisions in human resource management systems
Authors: Jayanthi Ranjan, D. P. Goyal, S. I. Ahson
Venue: International Journal of Business Information Systems (2008)

This paper presents the role of data mining in Human Resource Management Systems (HRMS). A deep understanding of the knowledge hidden in Human Resource (HR) data is vital to a firm's competitive position and organisational decision making. Analysing the patterns and relationships in HR data is quite rare. The HR data is usually treated to answer queries. Because HR data primarily concerns transactional processing getting data into the system, recording it for reporting purposes it is necessary for HRMS to become more concerned with the quantifiable data. We show how data mining discovers and extracts useful patterns from this large data set to find observable patterns in HR. The paper demonstrates the ability of data mining in improving the quality of the decision-making process in HRMS and gives propositions regarding whether data-mining capabilities should lead to increased performance to sustain competitive advantage.
Practical MANETs for Pervasive Cattle Monitoring
Authors: Bartosz Wietrzyk, Milena Radenkovic, Ivaylo Kostadinov
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The application of Mobile Ad Hoc Networks to cattle monitoring has the potential to increase the profitability of cattle production and positively impact the everyday live of farm personnel. The main research challenges are identifying and refining realistic requirements for a MANET routing protocol and designing such protocol. In this paper we report on the field experiments we performed in order to address this. Our approach builds on energy efficient MANETs to provide continuous monitoring of multidimensional parameters of animal mobility including temporal and spatial walking intensity and feed intake in order to detect oestrus, pregnancy, animal diseases and reduced efficiency of pastures. We support remote and in-situ, specific and range queries and notifications about newly detected events. Our extensive set of emulations show that we achieve lower and more balanced energy consumption while preserving the delays for increasing number of nodes within the user expected boundaries.
SPM: A Security Policy Based on Micropayment in Ad Hoc Networks
Authors: Yi Wang, Furong Wang, Chunming Rong, Sufang Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Ad hoc networks are confronted with security challenges due to the characteristics such as dynamic topology, limited processing power, lack of fixed infrastructure and so on. In this paper, we propose a Security Policy based on Micropayment (SPM) to enhance the security of Ad hoc networks and the cooperation of nodes. SPM adopts scrip which issued by neighboring nodes to stimulate nodes to cooperate with each other and employs reputation mechanism to exclude the malicious nodes from the networks. Simulation results indicate that compared with other security policies, SPM makes Ad hoc networks more flexible and effective against misbehaviors of nodes and greatly controls the activities of nodes through the perfect combination of reputation and scrip.
Investigating generic network location service based on dht technology
Authors: Laban Mwansa, Jan Janeček
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

Networking technologies use several addressing/ identifification schemata (MAC addresses, IP addresses, DNS names, SIP URIs and E.164 numbers, GSM BTS identifications), efficient and reliable translations among them influence networking service. Older translation schemata are using tables and their hierarchies formed statically and dynamically (e.g. ARP, DNS, ENUM). Schemata for recent networking services (e.g. SIP which provides SIP URLs to IP addresses translation) are proposed on the basis of Distributed Hash Tables (DHTs). Our paper describes an alternative approach to address translations based on DHT usage. Identification record is formed of all identifcations that the network device has, and all these identifications are used to create keys for storing the record to a DHT. As a result, the record is stored in more copies and each copy provides access to others, allowing us to create efficient update and recovery mechanisms. Storing collections of network identifications has some advantages: straightforward implementation of all possible translations at the same time (provides a way to location services which are unavailable in current systems), and fault-tolerance to DHT's node and network failures due to inherent replication of identification records.
Trustworthy and personalized computing on public kiosks
Authors: Scott Garriss, Rámon Cáceres, Stefan Berger, Reiner Sailer, Leendert van Doorn, Xiaolan Zhang
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Many people desire ubiquitous access to their personal computing environments. We present a system in which a user leverages a personal mobile device to establish trust in a public computing device, or kiosk, prior to resuming her environment on the kiosk. We have designed a protocol by which the mobile device determines the identity and integrity of all software loaded on the kiosk, in order to inform the user whether the kiosk is trustworthy. Our system exploits emerging hardware security technologies, namely the Trusted Platform Module and new support in x86 processors for establishing a dynamic root of trust. We have demonstrated the viability of our approach by implementing and evaluating our system on commodity hardware. Through a brief survey, we found that respondents are generally willing to endure a delay in exchange for an increased assurance of data privacy, and that the delay incurred by our unoptimized prototype is close to the range tolerable to the respondents. We have focused on allowing the user to personalize a kiosk by running her own virtual machine there. However, our work is generally applicable to establishing trust on public computing devices before revealing any sensitive information to those devices.
Implementation of ontology mapping for computational agents
Authors: Roman Neruda
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper describes ontological description of computational agents, their properties and abilities. The goal of the work is to allow for autonomous behavior and semi-automatic composition of agents within a multi-agent system. The system has to be create foundation for the interchangeability of computational components, and emergence of new models. This paper focuses on ways of representing agents and systems in standard formalisms, such as description logics, OWL, and Jade.
Markov convexity and local rigidity of distorted metrics
Authors: Manor Mendel, Assaf Naor
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The geometry of discrete tree metrics is studied from the following perspectives: Markov p-convexity, which was shown by Lee, Naor, and Peres to be a property of p-convex Banach space, is shown here to be equivalent to p-convexity of Banach spaces. On the other hand, there exists an example of a metric space which is not Markov p-convex for any finite p, but does not uniformly contain complete binary trees. Note that the previous item implies that Banach spaces contain complete binary trees uniformly if and only if they are not Markov p-convex for any finite p. For every B>4, a metric space X is constructed such that all tree metrics can be embedded in X with distortion at most B, but when large complete binary trees are embedded in X, the distortion tends to B. Therefore the class of finite tree metrics do exhibit a dichotomy in the distortions achievable when embedding them in other metric spaces. This is in contrast to the dichotomy exhibited by the class of finite subsets of L_1, and the class of all finite metric spaces.
Wireless sensor networking for rain-fed farming decision support
Authors: Jacques Panchard, Seshagiri Rao, Madavalam S. Sheshshayee, Panagiotis Papadimitratos, Sumanth Kumar, Jean-Pierre Hubaux
Venue: Proceedings of the second ACM SIGCOMM workshop on Networked systems for developing regions (2008)

Wireless sensor networks (WSNs) can be a valuable decision-support tool for farmers. This motivated our deployment of a WSN system to support rain-fed agriculture in India. We defined promising use cases and resolved technical challenges throughout a two-year deployment of our COMMON-Sense Net system, which provided farmers with environment data. However, the direct use of this technology in the field did not foster the expected participation of the population. This made it difficult to develop the intended decision-support system. Based on this experience, we take the following position in this paper: currently, the deployment of WSN technology in developing regions is more likely to be effective if it targets scientists and technical personnel as users, rather than the farmers themselves. We base this claim on the lessons learned from the COMMON-Sense system deployment and the results of an extensive user experiment with agriculture scientists, which we describe in this paper.
Vibration Suppression Techniques in Feedback Control of a Very Flexible Robot Manipulator
Authors: Mohd Ashraf Ahmad, Zaharuddin Mohamed, Haszuraidah Ishak, Ahmad Nor Kasruddin Nasir
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents the use of angular position control approaches for a flexible robot manipulator with disturbances effect in the dynamic system. Delayed Feedback Signal (DFS) and Proportional-Derivative (PD) controller are the techniques proposed in this investigation to actively control the vibrations of flexible structure. A constrained planar single-link flexible manipulator is considered and the dynamic model of the system is derived using the assume mode method. A complete analysis of simulation results for each technique is presented in time domain and frequency domain respectively. Performances of the controller are examined in terms of vibration suppression and disturbances cancellation. Finally, a comparative assessment of the impact of each controller on the system performance is presented and discussed.
Compositional information flow security for concurrent programs
Authors: Annalisa Bossi, Carla Piazza, Sabina Rossi
Venue: Journal of Computer Security (2007)

We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched with parallelism and atomic statement constructors. We study different classes of programs obtained by instantiating the general framework and we prove that they entail the noninterference principle. Accurate proof techniques for the verification of such properties are defined by exploiting the Tarski decidability result for first-order formulae over the reals. Moreover, we illustrate how the unwinding framework can be instantiated in order to deal with intentional information release and we extend our verification techniques to the analysis of security properties of programs admitting downgrading.
Human Workflows via Document-Driven Process Choreography
Authors: Jiangbo Dang, Candemir Toklu, Ken Hampel, Urs Enke
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

Workflows are ubiquitous in enterprise applications from manufacturing industry to healthcare industry. A human workflow is a dynamic set of tasks performed by human participants to reach a shared goal. Commitments among participants can be used to model the workflow and coordinate their execution of it. These commitments can be captured by role-based orchestrations in a Microsoft workflow implementation with Microsoft BizTalk server (BizTalk). BizTalk provides tools and methodologies to compose these orchestrations that can be executed as business processes and monitored by Business Activity Monitoring (BAM) dashboards. In this paper, we present methodologies to develop a human workflow by using role-based BizTalk orchestrations to capture commitments extracted from a process-centric workflow definition. In addition, we discuss the lifecycle management of a human workflow with an emphasis on process design and monitoring.
Modeling of Control Loop in Production Scheduling for Overall Inventory Cost Reduction
Authors: Nikola Gjeldum, Ivica Vea, Draen Bajic
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Performance of manufacturing organization depends on production scheduling which is an essential part of the management of production systems. Effective scheduling can lead to performance which results in reducing work in process inventories [1]. According to the lean production principles, excessive production and high inventory level are the biggest waste in production process [2]. Inventory level higher then it is necessary for fulfilling the costumer demands, leads to additional costs in warehouse. Objectives of production control are graphically represented over time in diagrams: inventory, lead time, input orders and output of production process. In this paper, the fact that the input and output amount of work coming from released orders of one product are not equal in every period, results with a technique to balance input against output continuously, to establish a control loop.
An evaluation of the mobile usage of e-lecture podcasts
Authors: Wolfgang Hürst, Martina Welte, Sabine Jung
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Distributing recorded classroom lectures via podcasting for replay on mobile devices is gaining increasing popularity. However, few insights exist regarding the actual usage and usefulness of such files, especially in situations where high-quality recordings of those lectures are available for non-mobile replay as well. In this paper, we compare the results of two surveys done with local students who had access to podcasts as well as high-quality files for replay on laptops and desktop PCs on the one hand and external users who just subscribed to the podcasts on the other hand. We compare the usage of the different versions, address the motivations of the two different user groups, and discuss general issues such as perception of the quality of the audio and video signals. Based on our observations we conclude that the added value of such "e-lecture podcasts" is mainly in its potential for mobile usage, whereas most of the other arguments given in favor of such an e-lecture delivery are rather due to the better visibility and "advertisement" of podcasts then justifiable by the technology involved.
Lifting-Based View Compensated Compression of Volume Rendered Images for Efficient Remote Visualization
Authors: Hariharan G. Lalgudi, Michael W. Marcellin, Ali Bilgin, Mariappan S. Nadar
Venue: Proceedings of the Data Compression Conference (2008)

Remote visualization of volumetric images has gained importance over the past few years in medical and industrial applications. Volume visualization is a computationally intensive process, often requiring hardware acceleration to achieve a real time viewing experience. One remote visualization model that can accomplish this would transmit rendered images (with dedicated hardware) from the server based on view-point requests from a client. For a given server-client bandwidth, an efficient compression scheme is vital for transmitting high quality rendered images. In this paper, we present a new compression scheme that utilizes the geometric relationship between view-points to exploit the correlation between successive rendered images. The proposed method performs better than AVC, the state of the art video compression standard. Additionally, our scheme obviates motion estimation between rendered images, enabling significant reduction to the complexity of the encoder.
A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
Authors: Xiaojiao Tong, Chen Ling, Liqun Qi
Venue: Journal of Computational and Applied Mathematics (2008)

This paper proposes a new algorithm for solving a type of complicated optimal power flow (OPF) problems in power systems, i.e., OPF problems with transient stability constraints (OTS). The OTS is converted into a semi-infinite programming (SIP) via some suitable function analysis. Then based on the KKT system of the reformulated SIP, a smoothing quasi-Newton algorithm is presented in which the numerical integration is used. The convergence of the algorithm is established. An OTS problem in power system is tested, which shows that the proposed algorithm is promising.
Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
Authors: Paolo Detti
Venue: Journal of Scheduling (2008)

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.
Promo: novel metrics that combine hits and accessibility criteria in order to Promote important content and links
Authors: John Garofalakis, John Giannakou, Theodoula Giannakoudi, Evangelos Sakkopoulos
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this work, we introduce metrics and a proposed procedure to measure the popularity of a website. We present two novel metrics, Promo and Promo(2) that take advantage of the internal link structure of a website, in order to gain important navigation information. This is indicative of the difficulty the user encounters to access a particular link and can be combined with statistics gained from the log files as a metric of popularity. The two metrics propose a different definition of the popularity of a web object in order to generate a sorted list of promotion values for a website's links. We have delivered a web tool that implements the proposed procedure in order to facilitate a site designer to manipulate his/her web server log data, receive recommendations and popularity results and finally proceed with changes in the structure or position of links. Overall, the experimental study using user-based accesses log data, has been encouraging and it has verified the effectiveness of the Promo metrics.
Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web
Authors: Thomas Lukasiewicz
Venue: Fundamenta Informaticae (2008)

There are numerous semantic web applications where dealing with vagueness and imprecision plays an important role. Some examples of such applications are (i) multimedia information processing and retrieval, (ii) natural language interfaces to the Web, and (iii) ontology mapping and information retrieval. In this paper, towards dealing with vagueness and imprecision in the reasoning layers of the Semantic Web, we present an approach to normal fuzzy description logic programs under the answer set semantics, which are a generalization of normal description logic programs (dl-programs) under the answer set semantics by fuzzy vagueness and imprecision in both the description logic and the logic program component. We define a canonical semantics of positive and stratified fuzzy dl-programs in terms of a unique least model and iterative least models, respectively. We then define the answer set semantics of general fuzzy dl-programs, and show in particular that all answer sets of a fuzzy dl-program are minimal models, and that the answer set semantics of positive and stratified fuzzy dl-programs coincides with their canonical least model and iterative least model semantics, respectively. We also provide a characterization of the canonical semantics of positive and stratified fuzzy dl-programs in terms of a fixpoint and an iterative fixpoint semantics, respectively. Furthermore, we provide a reduction of fuzzy dl-programs under the answer set semantics to normal dl-programs under the answer set semantics. Finally, we also describe a special case of fuzzy dl-programs where query processing can be done in polynomial time in the data complexity.