waashk/dblp huggingface dataset:
using xml schema to improve writing, validation, and structure of ws-policies. ws-policies provide a standard to describe non-functional properties of web services. these properties are usually defined by domain-specific assertions. in some domains, for example security, nested assertions are heavily used to formalize detailed properties. since the ws-policy schema syntactically allows the use of arbitrary child elements for the elements defined in the ws-policy namespace, the validation of policy documents against concrete policy schemata is also complicated. additionally, policies become bloated by requiring the use of nested policies that are often empty or just containing one entry. in this paper, we suggest to enhance the xml schema of concrete policies to allow for easier writing, better validation, simpler structure, and better tool support when working with policies. the enhancements are realized using domain-specific policy elements and omitting unnecessary nested policy elements. a template for enhancing the xml schema to support these requirements is provided. old policy documents still remain compatible with the new schema. the proposed improvements are applied to a complex concrete policy, namely ws-securitypolicy.
cross-organizational process monitoring based on service choreographies. business process monitoring in the area of service oriented computing is typically performed using business activity monitoring technology in an intra-organizational setting. due to outsourcing and the increasing need for companies to work together to meet their joint customer demands, there is a need for monitoring of business processes across organizational boundaries. thereby, partners in a choreography have to exchange monitoring data, in order to enable process tracking and evaluation of process metrics. in this paper, we describe an event-based monitoring approach based on bpel4chor service choreography descriptions. we show how to define monitoring agreements specifying events each partner in the choreography has to provide. we distinguish between resource events and complex events for calculation of process metrics using complex event processing technology. we present our implementation and evaluate the concepts based on a scenario.
flash-aware cluster allocation method based on filename extension for fat file system. to support conventional file systems such as fat, the nand flash memory needs the ftl to provide transparent block device emulation to the file system. however, the log-block ftl, the most popularly used ftl, suffers from the performance decline in workloads that contain many random writes. when the file system is not aware of the nand flash, it often allocates files fragmented in the nand flash, and this causes many random writes. consequently, to improve the performance of the ftl, the file system must allocate files defragmented in the nand flash. in this paper, we propose a nand flash-aware cluster allocation method for fat file system, named feca (flash-aware extension-based cluster allocation). feca exploits the following two observations. the first one is that the effort to defragment small-sized files may not improve the performance at all times. the second one is that there is a very strong correlation between the size and the filename extension of files in most cases. based on those observations, feca predicts sizes of files by using their extensions and determines the allocation policy for them. to evaluate the effectiveness of feca, we devise two defragmentation metrics considering the features of the nand flash. we prove that feca outperforms previous methods in terms of both metrics through extensive experiments. the results show that feca improves the performance by 10 % and reduces the garbage collection frequency up to 35% compared to the previous methods.
transductive learning for spatial regression with co-training. many spatial phenomena are characterized by positive autocorrelation, i.e., variables take similar values at pairs of close locations. this property is strongly related to the smoothness assumption made in transductive learning, according to which if points in a high-density region are close, corresponding outputs should also be close. this observation, together with the prior availability of large sets of unlabelled data, which is typical in spatial applications, motivates the investigation of transductive learning for spatial data mining. the task considered in this work is spatial regression. we apply the co-training technique in order to iteratively learn two separate models, such that each model is used to make predictions on unlabeled data for the other. one model is built on the set of attribute-value observations measured at specific sites, while the other is built on the set of aggregated values measured for the same attributes in nearby sites. experiments prove the effectiveness of the proposed approach on spatial domains.
target-based database synchronization. synchronizing source and target databases is an important task in many database applications. there are instances when the synchronization of source and target databases must be driven from the target's side and involve no changes to the source's schema or triggers. we describe an algorithm for such synchronization. our algorithm groups tuples into partitions and compares hashes of matching source and target partitions before synchronizing only those partitions whose hashes do not match. the hash comparisons decrease the number of tuples that must be exchanged when the source and target are nearly synchronized already. two variants of full replication that differ on locking strategies are used as benchmarks. empirical results show that our method outperforms both when there are few changes to the database and outperforms row-level locking when fewer than 70% of the partitions are changed.
an indoor tracking algorithm with the virtual reference based positioning. the widespread popularization of ubiquitous devices promotes fervent demands for location-based services (lbs). this paper technically proposes a methodology named virtual reference based positioning (vrbp) for the location positioning, which models the rfid positioning systems with virtual reference tags and constructs such information with a classical radio propagation model in order to enhance positioning accuracy. instead of deploying a high density of rfid tags, the notion of vrbp decreases the possibility of signal interference. furthermore, we propose the vt-landmarc, a tracking algorithm which applies the vrbp and manifests a superior performance over the original landmarc in positioning accuracy. besides these advantages, with the help of the vrbp, the vt-landmarc ameliorates the defect in original landmarc that the location error may increase significantly in the margin area. and the vrbp methodology offers a practical solution for the location estimation with a scarce density of reference tags.
an algorithm to generate the context-sensitive synchronized control flow graph. the verification of industrial systems specified with csp often implies the analysis of many concurrent and synchronized components. the cost associated to these analyses is usually very high, and sometimes prohibitive, due to the complexity imposed by the non-deterministic execution order of processes and to the restrictions imposed on this order by synchronizations. to overcome this problem, there has been a recent proposal that allows to statically simplify a specification before the analyses. this simplification allows to drastically reduce the time needed by the analyses because it reduces the state explosion. unfortunately, the approach has been implemented but it has not been formalized neither proved correct. in this paper, we formally define the data structures needed to automatically simplify a csp specification and we define an algorithm able to automatically generate these data structures.
input device for disabled persons using expiration and tooth-touch sound signals. this paper presents the realization of an input device for disabled persons, a hands-free man-machine interface using expiration and tooth-touch sound signals. in our research, the expiration signal was detected by a piezo film sensor array and the tooth-touch sound signal by a bone-conduction microphone. the piezo film sensor had two useful effects, piezoelectric and pyroelectric. utilizing both these effects, we could detect vibration and temperature variation simultaneously. thus, the duration and strength of expiration could be detected more accurately, minimizing the effect of interference from outside disturbance. the sensors also had added benefits, including being very light weight, small in size and of low-price. the device enabled disabled persons to dramatically extend the number of control channels hands-free by changing the strength and duration of expiration, in conjunction with the tooth-touch sound signal. we developed a novel method for separating the pyroelectric and piezoelectric signals from the original signal. we then designed the device using hardware description language (vhdl) and applied it in a field programmable gate array (fpga) chip. we tested our device in a head mounted display (hmd) controller. finally, we evaluated its performance using the following categories: input error rate, usability and input efficiency compared with a tooth-touch sound alone based input device.
r-leap+: randomizing leap+ key distribution to resist replay and jamming attacks. the unique properties of wireless sensor networks make key distribution a particularly difficult problem. two protocols, leap+ and eschenauer-gligor (eg), offer creative and effective solutions to this problem via time-limited key establishment and randomized key pre-distribution, respectively. however, leap+ key establishment may be thwarted by jamming attacks, and eg is vulnerable to node compromise attacks. in this paper, we offer a hybrid of these two schemes that preserves the desirable properties of each scheme, but is immune to each scheme's greatest weakness.
a framework for risk analysis in virtual directory security. directory services are used by almost every enterprise computing environment. virtual directories are components that provide directory services in a highly customized manner. unfortunately, an analysis of risks posed by their unique position and architecture has not been completed. we present a detailed analysis of six attacks to virtual directory services. we also describe various categories of attack risks, and discuss what is necessary to launch an attack. finally, we present a framework to use in analyzing these risks.
serviso: a selective retransmission scheme for video streaming in overlay networks. several works proposed methods to make video streaming scalable over the number of clients, avoiding the linear growth of bandwidth requirements for the media source node. some are based on overlay networks built on top of the ip protocol and distribute content between overlay partners. in this way the clients share their bandwidth, reducing the burden on the source node. similar to data-oriented proposals, this work breaks the media into segments which are requested from partners when available. novel in this technique is the explicit handling of losses with a selective retransmission mechanism based on h.264 content, controlled by estimated decoding importance of packets.
semi-automated diagnosis of foda feature diagram. a semi-automated model diagnostic method is proposed for foda feature diagram, a primary modeling notation used in software product line engineering. the proposed method includes a propositional logic interpretation of the feature diagram and a diagram-slicing algorithm for locating bugs. in addition to logic-based formalization of the semantics, the novelty of our approach is that it uses heuristics taking into account the diagram graph structure. although human intelligence is always involved in removing bugs from feature diagrams, the checking and diagnosing of them can be automated to some extent.
text versus non-text distinction in online handwritten documents. the aim of this paper is to explore how well the task of text vs. nontext distinction can be solved in online handwritten documents using only offline information. two systems are introduced. the first system generates a document segmentation first. for this purpose, four methods originally developed for machine printed documents are compared: x-y cut, morphological closing, voronoi segmentation, and whitespace analysis. a state-of-the art classifier then distinguishes between text and non-text zones. the second system follows a bottom-up approach that classifies connected components. experiments are performed on a new dataset of online handwritten documents containing different content types in arbitrary arrangements. the best system assigns 94.3% of the pixels to the correct class.
design of a market-based mechanism for quality attribute tradeoff of services in the cloud. cloud computing, with its promise of (almost) unlimited computation, storage and bandwidth, is increasingly becoming the infrastructure of choice for many organizations. as applications gain in popularity and mature, the quality attributes demanded of them change significantly. applications that manage themselves and exhibit different quality attributes, based on demand, are the ideal that we would like to have. creating self-managing applications for the cloud present significant problems, since the cloud infrastructure is not under the application architect's control. we propose an initial design of novel market-based mechanism to allow web-applications living on the cloud to self-manage with regard to their quality attributes. we use a scenario to exemplify and evaluate the approach.
performance analysis of flexray-based systems using real-time calculus, revisited. the flexray protocol [4] is likely to be the de facto standard for automotive communication systems. hence, there is a need to provide hard performance guarantees on properties like worst case response times of messages, their buffer requirements, end-to-end latency (for example, from sensor to actuator), etc., for flexray based systems. the paper [11] provides an analysis for finding worst case response times of the messages transmitted on the flexray bus, but the analysis is done using ilp formulation and is thus computationally expensive. the paper [5] models the flexray in the analytic framework of real-time calculus [12, 3] and is compositional as well as scalable. in this paper, we show that the analysis of [5] may lead to results that are over optimistic; in particular, we show that obtaining the "upper service curves" is not trivial and does not follow the reasoning of the "lower service curves" which the authors obtain. we also provide tighter "lower service curves" than that of [5]. finally we show that our model allows the messages to be of variable size which is not the case with [5].
digital energy metering for electrical system management. electrical energy metering is investigated due to the demand for energy efficiency. the scope was digital dc metering (ac later), in a cost effective and accurate manner. accurate voltage, current and time values were necessary. detailed algorithms were needed and created. an energy calibrator system was designed with two agilent meters, an rto-b sense resistor, and a pc interface (visual basic). a prototype meter was designed using the msp430 microcontroller and bvs-m sense resistor (1m&omega;), and was tested. special attention had to be given to the msp430's embedded 16-bit adc and op-amp system which was complicated, yet powerful. from the msp430, a highly functional, low cost energy meter was realized.
exploring business value models from the inter-organizational collaboration perspective. from a strategic enterprise perspective, the success of e-services depends on their ability to work as a medium for the exchange of business values. thus, there is a need to be able to describe and analyze business collaborations in a structured way, in order to identify the needs and appropriate offerings of the participating actors. to model business collaborations, business value models are increasingly used. however, a question remains - how to systematically create value models in order to identify the offerings of the involved actors, while spanning the whole life-cycle of a business collaboration? in this study we propose a method for designing more exploratory business models with a focus to how: (a). consumers classify values, and (b). the values are elicited in different phases of business collaboration life-cycle. a case study from the swedish health care sector is used to ground and apply the presented method.
classification of violent web images using context based analysis. the development of the web has been paralleled by the proliferation of a harmful content on its pages. using violent web images as a case study, we tend to present a novel approach to their classification. this subject is of high importance as it has a potential use in many applications such as violent web sites filtering. we, therefore, focus our attention on the extraction of contextual image features from the web page. also, we present a comparative study of different data mining techniques to classify violent web images. the results we achieved show that our approach can detect violent content effectively.
agents & artefacts for multiple models coordination: objective and decentralized coordination of simulators. complex systems simulation implies the interaction of different scientific fields. however, most of the time people involved into the simulation process do not know intricate distributed simulation tools and only care about their own domain modelling. we propose a framework (called aa4mm) to build a simulation as a society of interacting models. the main goal is to reuse existing models and simulators and to make them interact. the coordination challenges remain to the aa4mm framework so that the simulation design and implementation stay as simple as possible. in this paper, we present the coordination model which intends to decentralize the simulators interactions. we propose to use the environment through the notion of artefact in order to deal with the coherence, compatibility and coordination issues that appear in parallel simulations.
exploiting non-functional preferences in architectural adaptation for self-managed systems. among the many challenges of engineering dependable, self-managed, component-based systems is their need to make informed decisions about adaptive reconfigurations in response to changing requirements or a changing environment. such decisions may be made on the basis of non-functional or qos aspects of reconfiguration in addition to the purely functional properties needed to meet a goal. we present a practical approach for using non-functional information to guide a procedure for assembling, and subsequently modifying, configurations of software components, and compare the performance of two variants of the approach. in addition, we outline a scheme for monitoring non-functional properties in the running system such that more accurate information can be utilised in the next adaptation.
quantitative assessments of key success factors in software process improvement for small and medium web companies. this replicated study investigates spi success factors for small and medium web companies using data from 20 pakistani web companies and 72 respondents. it applies the same theoretical model of spi success factors, techniques and data collection questionnaire proposed and employed in [17]; however, it differs from [17] in that dyba investigated spi success factors for software companies, whereas this study focuses solely on web companies. therefore the contribution of this work is twofold: i) to replicate dyba's study assessing similarity of patterns within the context of small and medium web companies; ii) to extend the theoretical model proposed in [19] [21] to small and medium web companies. the significance of six contributing independent variables, 42 sub-factors and the effects of two moderating variables on dependent variable spi success have been analyzed.
parallel genetic algorithm approaches applied to solve a synchronized and integrated lot sizing and scheduling problem. this paper evaluates different parallel approaches for multipopulation genetic algorithm. these approaches are applied to solve a synchronized and integrated lot sizing and scheduling problem. in this problem, the challenge is to simultaneously determine lot sizing and scheduling for raw materials in tanks and products in lines. first, the parallel algorithms are designed to be executed using a multicore server. the best approach is also executed by duo core computers using mpi. a set of real-world instances found in the literature are solved. also, a new set of instances is proposed. the speedups improvements are showed as well as the quality of final solutions found.
mobile intelligent interruptions management (miim): a context aware unavailability system. mobile phones that currently cause interruptions by blindly allowing calls to ring at busy moments and inappropriate situations can be managed using context aware computing, ubiquitous computing, and the available sensors built into a modern handheld. this paper proposes the architecture of a system named mobile intelligent interruptions management (miim), created for the automated administration of personal unavailability with regard to cell phones. here, we provide the description of the problem, desirable characteristics and architecture of such an interruption management system. the system is being simulated and the initial results show that miim's computational volumes are low enough for a mobile device. platform support has been found in google android.
chemotaxis-based sorting of self-organizing heterotypic agents. cell sorting is a fundamental phenomenon in morphogenesis, which is the process that leads to shape formation in living organisms. the sorting of heterotypic cell populations is produced by a variety of inter-cellular actions, e.g. differential chemotactic response, adhesion and motility. via a process called chemotaxis, living cells respond to chemicals released by other cells into the environment. each cell can respond to the stimulus by moving in the direction of the gradient of the cumulative chemical field detected at its surface. inspired by the biological phenomena of chemotaxis and cell sorting in heterotypic cell aggregates, we propose a chemotaxis-based algorithm for the sorting of self- organizing heterotypic agents. in our algorithm two types of agents are initially randomly placed in a toroidal environment. agents emit a chemical signal and interact with nearby agents. given the appropriate parameters, the two kinds of agents self-organize into a complex aggregate consisting of a group of one type of agents surrounded by agents of the second type. this paper describes the chemotaxis- based sorting algorithm, the behaviors of our self-organizing heterotypic agents, evaluation of the final aggregates and parametric studies of the results.