waashk/dblp huggingface dataset:
a real time financial system based on grid and cloud computing. cloud computing is gaining popularity to the extent that the new "xaas" service category introduced will gradually take the place of many types of computational and storage resources used today. in this regard, grid computing, on which the large scale supply of cloud services is based, will play a key role in defining how those services will be provided. this paper concerns the analysis and preliminary design of a real time financial system that relies on cloud computing technologies for performing macroeconomic analysis and forecasts of the financial markets and their instruments. cloud and grid paradigms generate different added values. some of these are examined in the paper, for instance the use of an instruction set to interact with the grid. this work uses the results obtained in the cybersar project managed by the cosmolab consortium (italy). the system analyzed and described herein will be implemented in the cybersar computational grid by autumn 2009.
optimal candidate generation in spatial co-location mining. existing level-wise spatial co-location algorithms suffer from generating extra, non-clique candidate instances and thus requires cliqueness checking at every level. in this paper, we propose a novel, spatial co-location mining algorithm which automatically generates co-located spatial features without generating any non-clique candidates at any level. subsequently our algorithm generates less candidates than other existing level-wise co-location algorithms without losing any information. the benefit of our algorithm has been clearly observed at an earlier stage in the mining process.
development of a biosignals framework for usability analysis. the understanding of human physical and physiological signals and expressions, together with a growing processing and control capacity allows for new approaches in interactive systems design. in this poster, we introduce constitutive elements and steps towards the integration of eeg (electroencephalography) signals in a system to analyze reading activities. the poster presents system design choices that include the software architecture and the feature extraction and classification techniques used in the first prototypes.
an optimized change-driven regression testing selection strategy for binary java applications. selective regression testing involves re-testing of software systems with a subset of the whole test suite to verify that modifications have not caused adverse impacts to existing functions complied with the requirements specifications. with the growing of globalization and individual testing services providers, many testing and development teams belong to different organizations, and often the testing teams only get a binary release of the application without access to its source code. this makes source code analysis based regression test selection strategy not applicable. meanwhile source code analysis based approach has scalability problem for large applications, which hinders its wide application in industry. this paper presents an optimized regression testing selection strategy based on binary java file change analysis, through which the problems around binary java applications are avoided. besides static regression test suite reduction and test prioritization factors, continuous and real time testing execution information are incorporated as fault-proneness indicator of the selected test cases to dynamically select and prioritize the regression test suites. in addition, the whole strategy is lightweight, making the regression test selection process more automated and effective. experiments show that this strategy can guarantee the change point coverage, reveal faults quickly, and scale to industry-size regression testing scenarios under resource and time constraints.
network protocol interoperability testing based on contextual signatures and passive testing. this paper presents a methodology for interoperability testing based on contextual signatures and passive testing with invariants. the concept of contextual signature offers a framework to add information on the states, the values of parameters, as well as logical connectors that increases the expressive power of invariants. this allows expressing horizontal and vertical interoperability properties, i.e., between layers of a protocol stack or end-to-end communication between distant entities. in order to test interoperability, we have defined a correlation algorithm between the events collected from different network views (client or network side). once the correlation has been performed, we apply the contextual signatures that characterize interoperability properties to check their validity. to illustrate the application of the proposed approach, a real case study is proposed: the wireless application (wap) protocol. the results of the experimentation performed on this protocol are also presented.
webflowah: an environment for ad-hoc specification and execution of web services-based processes. this paper presents webflowah, an environment for ad-hoc specifying and executing web services-based business processes. webflowah employs common domain ontology to describe both web services and business processes. it allows specifying processes in terms of users' goals or desires that are expressed based on the concepts of such common domain ontology. this approach allows processes to be specified in an abstract high-level way, unburdening the user from dealing with underlying details needed to effectively run the process workflow.
identifying vulnerabilities and critical requirements using criminal court proceedings. information systems governed by laws and regulations are subject to civil and criminal violations. in the united states, these violations are documented in court records, such as complaints, indictments, plea agreements, and verdicts, which thus constitute a source of real-world software vulnerabilities. this paper reports on an exploratory case study to identify legal vulnerabilities and provides guidance to practitioners in the analysis of court documents. as legal violations occur after system deployment, court records reveal vulnerabilities that were likely overlooked during software development. we evaluate established requirements engineering techniques, including sequence and misuse case diagrams and goal models, as applied to criminal court records to identify mitigating requirements that improve privacy protections. these techniques, when properly applied, can help organizations focus their risk-management efforts on emerging legal vulnerabilities. we illustrate our analysis using criminal indictments involving the u.s. health insurance portability and accountability act (hipaa).
nectar: a dtn routing protocol based on neighborhood contact history. there are a number of scenarios where connectivity is intermittent, and a given destination may not be reachable at the moment a message is sent. networks with these characteristics are known as delay and disruption tolerant networks (dtn). the nectar protocol proposed in this article is based on the contacts history in order to create a neighborhood index and then determine the most appropriated route for dtns. simulations performed with real data retrieved from mobile and wireless environments at dartmouth college in scenarios where the occurrence of highly-partitioned networks is frequent, and with the presence of resource constrained nodes show that nectar is able to deliver more messages than epidemic and prophet protocols with lower consumption of network resources.
integration of formal specification, review, and testing for software component quality assurance. the reliability of software components is the most important quality required for software systems constructed using component-based development paradigm. this paper describes an approach to integrating formal specification, review, and testing for software component quality assurance. in this approach, requirements errors can be removed and missing requirements can be identified by formalizing requirements into a formal specification, and the resulting specification can then be used as a firm foundation for a rigorous review and testing of the program that is intended to provide a correct implementation. we discuss how formalization, review, and testing work together at different levels of software development for improving software quality through detecting and removing errors in documentation.
incremental outlier detection in data streams using local correlation integral. in this paper, an incremental outlier detection technique capable of dealing with a large amount of data is presented and evaluated in the context of intrusion detection. the proposed method is based on the local correlation integral (loci for short). the detection technique consists of two parts. the first part named insertion receives the sequence of input point and updates multi-granularity deviation factor (mdef) of the point at intervals. the second part named deletion deletes one or a batch of points. this technique is able to process streaming data in a single scan. moreover, the number of updates in the incremental loci algorithm per insertion/deletion of a single data record does not depend on the total number of data records. experimental results with real life data sets show that the technique is capable of dealing with data streams, successfully detecting outlier.
taking total control of voting systems: firmware manipulations on an optical scan voting terminal. the firmware of an electronic voting machine is typically treated as a "trusted" component of the system. consequently, it is misconstrued to be vulnerable only to an insider attack by someone with an in-depth knowledge of the system and access to the source code. this case study focuses on the diebold/premier accuvote optical scan voting terminal (av-os) that is widely used in the usa elections. we present three low level manipulations of the above voting terminal's firmware resulting in divergence from its prescribed operation: (i) the first bestows the terminal with a powerful memory card dumping functionality, (ii) the second enables the terminal to leak the ballot details through its serial port thus violating voter privacy during the election, (iii) the final third firmware manipulation is a proof of concept attack that swaps the votes of two candidates thus permanently destroying the election outcome in an undetectable fashion. this demonstrates the extent to which the firmware of the av-os can be modified with no insider knowledge or access to the source code. our results underscore the importance of verifying the integrity of the firmware of electronic voting terminals accompanied by sound auditing procedures to maintain the candor of the electoral process. we also note that this work is performed solely with the purpose of security analysis of av-os, and the first and the second firmware manipulations we describe serve a dual purpose in assisting the technological audits of actual voting procedures conducted using av-os systems.
flexible features: making feature modules more reusable. a growing trend in software construction advocates the encapsulation of software building blocks as features which better match the specification of requirements. as a result, programmers find it easier to design and compose different variations of their systems. feature-oriented programming (fop) is the research domain that targets this trend. we argue that the state-of-the-art techniques for fop have shortcomings because they specify a feature as a set of building blocks rather than a transition that has to be applied on a software system in order to add that feature's functionality to the system. we propose to specify features as sets of first-class change objects which can add, modify or delete building blocks to or from a software system. we evaluate this approach by implementing a simple text editor in a feature-oriented way and use the implementation to produce four different program variations. this shows that our approach contributes to fop on three levels: expressiveness, composition verification and bottom-up feature-oriented development.
artificial intelligence applied to computer forensics. to be able to examine large amounts of data in a timely manner in search of important evidence during crime investigations is essential to the success of computer forensic examinations. the limitations in time and resources, both computational and human, have a negative impact in the results obtained. thus, better use of the resources available are necessary, beyond the capabilities of the currently used forensic tools. herein, we describe the use of artificial intelligence in computer forensics through the development of a multiagent system and case-based reasoning. this system is composed of specialized intelligent agents that act based on the experts knowledge of the technical domain. their goal is to analyze and correlate the data contained in the evidences of an investigation and based on its expertise, present the most interesting evidence to the human examiner, thus reducing the amount of data to be personally analyzed. the correlation feature helps to find links between evidences that can be easily overlooked by a human expert, specially due to the amount of data involved. this system has been tested using real data and the results were very positive when compared to those obtained by the human expert alone performing the same analysis.
assessing complexity of service-oriented computing using learning classifier systems. the design paradigm service-orientation combines several proven design elements - such as decentralization, and scalability - with design elements from recent technology evolution, in particular abstraction and loosely coupling. however, few work has been conducted to investigate the complexity associated with service-oriented systems. this work provides an overview on complexity in soc, outlines the challenges in assessing complexity in soc, and proposes an experiment-based approach to assess the impact of various inherent properties on the complexity of service-oriented systems.
cmc-umc: a framework for the verification of abstract service-oriented properties. cmc and umc are two prototypical instantiations of a common logical verification framework for the analysis of functional properties of service-oriented systems. the service-oriented socl logic is used to describe the required system properties. computational models of the system can be built either using the cows specification language or designing the system as a collection of interacting uml state machines, and an on-the-fly model checker can be used to verify the satisfaction of the requirements and possibly to generate counterexamples or witnesses for them. an automotive case study is used to illustrate the overall framework.
improving stream correlation attacks on anonymous networks. the level of anonymity offered by low latency, interactive, anonymous networks is unknown. this paper implements correlation attacks on the deployed tor network and a simulated tor network under defined network conditions. the accuracy of the attacks act as a metric for the networks anonymity in the face of a passive adversary. from observation of the deployed tor network, several techniques were developed to compensate for some of the modifications the tor protocol induces in traffic. these techniques increase correlation accuracy by 10% to 40% for differing correlation functions. almost 50% of traffic streams on the simulated network are identified immediately with 10% of experimental traffic on the real tor network identified.
erika and open-zb: an implementation for real-time wireless networking. ieee 802.15.4/zigbee and tinyos have been playing an important role in leveraging a new generation of large-scale networked embedded systems. however, based on previous experience on the implementation and use of the ieee 802.15.4/zigbee protocols over tinyos, several problems (producing loss of synchronization and even network failures) emerge due to some limitations of this os, namely related to the lack of task pre-emption and prioritization. when real-time guarantees are required, different software solutions must be used to support real-time services in such networked applications. this being our objective, we implemented the ieee 802.15.4 protocol over erika, a real-time operating system for resource-constrained embedded systems. the results attained so far, and summarized in this short paper, demonstrate that erika enables reliable network behaviour and improved network performance. this paper outlines the most important aspects of the software implementation and reports comparative experimental results based on real platforms.
a novel distance-based classifier built on pattern ranking. instance-based classifiers that compute similarity between instances suffer from the presence of noise in the training set and from over-fitting. in this paper we propose a new type of distance-based classifier that instead of computing distances between instances computes the distance between each test instance and the classes. both are represented by patterns in the space of the frequent itemsets. we ranked the itemsets by metrics of itemset significance. then we considered only the top portion of the ranking that leads the classifier to reach the maximum accuracy. we have experimented on a large collection of datasets from uci archive with different proximity measures and different metrics of itemsets ranking. we show that our method has many benefits: it reduces the number of distance computations, improves the classification accuracy of state-of-the art classifiers, like decision trees, svm, k-nn, naive bayes, rule-based classifiers and association rule-based ones and outperforms the competitors especially on noise data.
designing reliable real-time concurrent object-oriented software systems. coordinated atomic actions is a conceptual framework used to increase the reliability (by fault tolerance) of concurrent object-oriented software systems. an extension of this conceptual framework to support the modelling of real-time software systems has been proposed. in this work we present our proposal for improvements of this extension focusing on recovery process optimisation, non-determinism reduction and time-related constructs extension.
heterogeneous bipolar criteria satisfaction handling in geographical decision support systems: an lsp based approach. in decision making, it is sometimes more appropriate to express what has to be rejected rather than what is permitted. moreover, permitted and rejected cases do not necessarily have to mirror each other, which is called heterogeneous bipolarity. to efficiently deal with heterogeneous bipolarity in decision making, a new bipolar criteria satisfaction modelling framework is proposed in this paper. this framework is based on independent degrees of satisfaction and dissatisfaction. its use and advantages are illustrated within the context of suitability maps for geographical decision making. a suitability map reflects the overall suitability of a specific area for a selected type of use. in a general case, the suitability of a location depends on a variety of criteria that are specified using reasoning techniques that are typical for soft computing. these criteria are evaluated and their resulting satisfaction and/or dissatisfaction degrees are aggregated using graded logic functions within the framework of the lsp method.
information retrieval from visual databases using multiple representations and multiple queries. this paper deals with information retrieval from visual databases. we propose an approach based on multiple representations, multiple queries, and the fusion of results returned by these different representations and queries. the basic idea of data fusion in information retrieval is to use several models, several representations, several search strategies, several queries, etc., and then fuse (merge) the results returned by each model, representation, strategy or query in a unique list of results by using appropriate fusion models. doing so, retrieval effectiveness should be improved without necessarily altering, in an important way, retrieval efficiency. we consider both the general retrieval case as well as the invariant retrieval case. we consider the case of textures in particular. benchmarking carried out on two (2) image databases shows that retrieval relevance is improved in a very appreciable way with the fused model.
improving folksonomies quality by syntactic tag variations grouping. folksonomies offer an easy method to organize information in the current web. this fact and their collaborative features have derived in an extensive involvement in many social web projects. however they present important drawbacks regarding their limited exploring and searching capabilities, in contrast with other methods as taxonomies, thesauruses and ontologies. one of these drawbacks is an effect of its flexibility for tagging, producing frequently multiple variations of a same tag. in this paper we propose a method to group syntactic variations of tags using pattern matching techniques. we propose the utilization of a fuzzy similarity measure and we conclude that this technique offers better results than other classic techniques after comparing them on a large real dataset.
revealing common sources of image spam by unsupervised clustering with visual features. in this paper, we investigate image spam with data mining techniques in order to reveal the common sources of unsolicited emails. to identify the origins, a two-stage clustering method groups visually similar spam images by exploring their visual features, including color feature, layout feature, text layout, and background textures. we test the proposed approach under different settings and combinations of features and measure the performance with a modified f-measure.
augmented reality environment for life support training. the area of medical qualification in life support training is being constantly improved. however, many problems still have to be faced in the training sessions. during these sessions the students or physicians can repetitively practice patient care procedures in simulated scenarios using anatomical manikins, especially designed for this type of training. current manikins have several resources incorporated to allow and facilitate qualified training, such as pulse, arrhythmia and auscultation simulator. however, some deficiencies have been detected in the existing ls training structure. for example: automatic feedback to the students in consequence of their actions on the manikin, images like facial expressions and body injuries, and their combination with sounds that represent the clinical state of the patient. the main goal of the arlist project is to qualify the traditional training environment currently used for ls training, introducing image and sound resources into the training manikins. thought these features we can simulate some aspects such as facial expressions, skin color changes and scratches and skin injuries through image projection over the manikin body, and also play sounds like cries of pain or groans of an injured man.