waashk/dblp huggingface dataset:
an onboard knowledge representation tool for satellite autonomous applications. artificial intelligence planning and scheduling (aips) techniques have been used both in ground-based and onboard space applications. aips relies on model-based domain knowledge representation systems, which is of value for many other applications, such as diagnosis systems and satellite simulators. this paper reports the development of an autonomous satellite onboard planner developed at inpe, and how this project lead us to start creating a more structured knowledge representation tool. the tool can be used not only by a planning application, but also by diagnosis and prognosis systems, satellite simulators and more, both in onboard and ground-based environments, and even outside the space field.
a validation methodology for agent-based simulations. validity forms the basic prerequisite for every simulation model, therefore also for reasonable usage of the agent-based simulation paradigm. however, models based on the multi-agent system metaphor tend to need some particular approaches. in this paper, i propose a process for validating agent-based simulation models that combines face validation, sensitivity analysis, calibration and statistical validation.
hardware implementation for network intrusion detection rules with regular expression support. signature-based network intrusion detection systems (nidss), such as snort and bro, rely on a rule database that describes traffic patterns for known attacks. they examine each packets flowing through a network segment and report suspicious packets to assure security. an attack signature may be represented in terms of fields in a packet such as source/destination ip addresses, source/destination ports, protocols, specific contents in payload, etc. typically, a perl compatible regular expression (pcre) is used to describe a specific content in the payload which may identify an attack. our study shows that over 60% of the execution time in an nids is found to perform string comparisons against a signature database of over 5,950 tokens and over 1,763 pcres. this paper proposes to extend a bit-parallel algorithm to support multi-byte processing and pcre. this design takes a segment of bytes from the payload of a packet and detects all possible tokens including those crossing text segment boundaries. a tool is designed to generate vhdl code from a rule set automatically. performance results are reported.
learning activities on health care supported by common sense knowledge. this paper discusses how common sense knowledge can be used by teachers for planning learning activities on health care. using common sense statements which were automatically collected, we are developing software that can be used to support the teaching and learning process, in a more contextualized form. when teachers consider the knowledge that learners already have, taking into account their common sense knowledge, they can devote their attention to correcting misconceptions, covering ignored topics and avoiding the obvious. also teachers can consider the common sense knowledge from a group of interest, preparing learners to interact with this group by calling their attention to topics which might be discussed with the group. through the experiment described here, we demonstrate that common sense can be useful to support the nursing education process, helping teachers to develop learning activities on the health care domain.
a novel protocol to prevent malicious nodes from misdirecting forward ants in antnet algorithm. antnet is an adaptive multi-agent routing algorithm inspired by ants' behavior, which can be used for the management of highly dynamic networks such as internet and wireless networks. making use of their ability to autonomously migrate from one node to another, antnet's forward ants explore the current condition of the network and then backward ants update the routing information stored on each node accordingly [3]. although in comparison with other routing algorithms, antnet have a better performance, especially regarding the load balancing factor, they are vulnerable against several security threats [8]. one important security threat is that a malicious node (router) can easily misdirect a forward ant to a node which is not located in the best path towards the destination node of that ant. in this paper this threat is precisely described and a protocol to mitigate it is suggested and to some extent analyzed. it is important to note that this threat arises from the nature of free-roaming mobile agents and thus, it exists in other routing algorithms utilizing such agents as well.
modelling adaptive services for distributed systems. there exists a growing class of distributed applications that require adaptive middleware services, i.e., services that are able to monitor changes in the execution environment and in the user's requirements, reacting to these changes by adapting their behaviour. this paper proposes modelling primitives that allow to describe the adaptation logic of distributed applications that use reconfigurable service compositions.
special track on data streams: editorial message. nowadays, very large databases are required to store massive amounts of data (we have daily giga bytes of data from radio telescopes and billions of telephone calls, emails, sms, satellite data, ip network traffic) that are continuously inserted, and queried. in several applications, data are better modelled not as persistent tables but rather as transient data streams. in some applications, it is not feasible to load the arriving data into a traditional database management systems (dbms), once traditional dbms are not designed to directly support the continuous queries required in these applications. these sources of data are called data streams. many researchers coming from different areas (databases, data mining, machine learning, olap, etc.) are designing new approaches or adapting some of the traditional algorithms to support data streams. the goal of this workshop is to convene researchers who deal with data streams models, processing continuous queries, sampling techniques and/or mining decision rules, decision trees, association rules, clustering, filtering, preprocessing, post processing, feature selection, visualization techniques, etc. from data streams and related issues.
on the design and performance evaluation of notification support for p2p-based network management. in this paper we present the design of a notification service used in a peer-to-peer (p2p) based network management solution called manp2p. the notification service is based on the publish/subscribe paradigm, and implemented over a p2p overlay that carry the notification messages using soap, the web services basic protocol. the performance of the notification service is evaluated considering the network traffic, the delivery delay, and the processing power required to forward notifications from physical devices (e.g., router, switches) to interested network managers. the results show that the notification service performs better if an increasing number of intermediate elements called mid-level managers is used between a notification source and destination.
special track on coordination models, languages and architectures: editorial message. for the tenth edition of the special track on coordination models, languages and architectures, interaction and coordination are among the main dimensions characterizing any modern notion of computing, deeply affecting the engineering of concurrent and distributed applications. there, the issue about how to put several heterogeneous components (processes, objects, services, agents, humans) together within a working system to integrate them fruitfully in an open and dynamic environments can be considered today among the most important and challenging issues.
extending peer-to-peer networks for approximate search. this paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. the encoding function maintains neighborhood relationships so that two similar inputs will result in two similar outputs. the error correcting code is then used to group the similar encoded values around special codewords. in this manner, similar content is located as close as possible in the network. the algorithm is tested in a simulated environment on a hypercube network overlay.
applying case-based reasoning in the evolution of deforestation patterns in the brazilian amazonia. patterns of deforestation in brazilian amazonia are often associated with different actors, their economic activities and their land use and land cover change strategies. these patterns are often analyzed as static landscape objects, they are not treated as objects evolving along the time. this paper proposes to apply the case-based reasoning (cbr) technique to establish rules and detect object deforestation evolution in an amazonia region. the objects were analyzed in a sequence of images from different periods creating the base and rules to apply cbr. the application of cbr can help the specialist to understand how different landscape objects evolve, to establish object trajectories and to represent that evolution.
interacting urns processes: for clustering of large-scale networks of tiny artifacts. we analyze a distributed variation on the p&oacute;lya urn process in which a network of tiny artifacts manages the individual urns. neighboring urns interact by repeatedly adding the same colored ball based on previous random choices. we discover that the process rapidly converges to a definitive random ratio between the colors in every urn and that the rate of convergence of the process at a given node depends on the global topology of the network. in particular, the same ratio appears for the case of complete communication graphs. surprisingly, this effortless random process supports useful applications, such as clustering and pseudo-coordinate computation. we present preliminary numerical studies that validate our theoretical predictions.
an audio wiki supporting mobile collaboration. wikis have proved to be very effective collaboration and knowledge management tools in large variety of fields thanks to their simplicity and flexible nature. another important development for the internet is the emergence of powerful mobile devices supported by fast and reliable wireless networks. the combination of these developments begs the question of how to extend wikis on mobile devices and how to leverage mobile devices' rich modalities to supplement current wikis. realizing that composing and consuming through auditory channel is the most natural and efficient way for mobile device user, this paper explores the use of audio as the medium of wiki. our work, as the first step towards this direction, creates a framework called mobile audio wiki which facilitates asynchronous audio-mediated collaboration on the move. in this paper, we present the design of mobile audio wiki. as a part of such design, we propose an innovative approach for a light-weight audio content annotation system for enabling group editing, versioning and cross-linking among audio clips. to elucidate the novel collaboration model introduced by mobile audio wiki, its four usage modes are identified and presented in storyboard format. finally, we describe the initial design for presentation and navigation of mobile audio wiki.
autonomic management policy specification in tune. distributed software environments are increasingly complex and difficult to manage, as they integrate various legacy software with specific management interfaces. moreover, the fact that management tasks are performed by humans leads to many configuration errors and low reactivity. this is particularly true in medium or large-scale distributed infrastructures. to address this issue, we explore the design and implementation of an autonomic management system. the main principle is to wrap legacy software pieces in components in order to administrate a software infrastructure as a component architecture. however, we observed that the interfaces of a component model are too low-level and difficult to use. therefore, we introduced higher-level formalisms for the specification of deployment and management policies. this paper overviews these specification facilities that are provided in the tune autonomic management system.
proposing metrics of difficulty of domain knowledge using usecase diagrams. in a system development, the knowledge of a target business is very important factor for the success of a development. the needed part of such knowledge is different for each stakeholder. therefore, we need a method to measure the level of understanding of a stakeholder and a method to categorize business knowledge. this paper proposes the metric of difficulty level in order to measure the business knowledge. moreover, we performed the experiment to confirm the suitability of the proposed metric.
a novel approach for test suite reduction based on requirement relation contraction. the goal of test suite reduction is to satisfy all testing requirements with the minimum number of test cases. existing techniques can be applied well on the constructed test suite. however, it is possible and necessary to optimize testing requirements before test case generation. in this paper test suite reduction is solved by testing requirement optimization. a requirement relation graph is proposed to minimize the requirement set by graph contraction. an experiment on specification-based testing is designed and implemented. the empirical studies show that the testing requirements can be optimized by the graph contraction methods effectively.
a new approach for interactive semantic image retrieval using the high level semantics. content-based image retrieval and text-based image retrieval are two fundamental approaches in the field of image retrieval. recently, the researchers use the combining approaches and semiautomatic image retrieval, using the user interaction in the retrieval cycle. in this paper, an image retrieval approach is introduced that provides the retrieval process semi-automatically using the relevance feedbacks of the user and the novel similarity metrics for related high level semantic labels to the images. the proposed approach can reply different requests in the image retrieval domain based on a hierarchical semantic network and doing a new kind of learning process by the feedbacks given by user. according to experiments, our proposed approach concludes considerable accuracy for retrieval results.
conflict-aware load-balancing techniques for database replication. middleware-based database replication protocols are more portable and flexible than kernel-based protocols, but have coarser-grain information about transaction access data, resulting in reduced concurrency and increased aborts. this paper proposes conflict-aware load-balancing techniques to increase the concurrency and reduce the abort rate of middleware-based replication protocols. experimental evaluation using a prototype of our system running the tpc-c benchmark showed that aborts can be reduced with no penalty in response time.
mdsd light for erp. fully-fledged model-driven software development is often too expensive for small and medium sized enterprises (smes). therefore we propose mdsd light which reduces the available adjustment possibilities, but offers an easy way of workflow and process management. we introduce a tool-suite which realizes the aspects of mdsd light and show the advantages of this approach in a short example.
improving the neural meshes algorithm for 3d surface reconstruction with edge swap operations. the reconstruction of a three-dimensional surface from a set of unorganized points is a fundamental process in a lot of applications, including laser range scanners, medical imaging, and others. this work presents a modified version of the neural meshes algorithm for surface reconstruction from point cloud, called neural meshes with edge swap, or neural meshes es. from the original basic neural meshes algorithm we developed a new heuristic that include an edge-swap operation, making the algorithm less sensible to parameters variation, improving the quality of the generated surfaces. the results show that the edge-swap operation is able to avoid a series of incorrect reconstructed areas in the mesh, mainly in the concave structures.
an integrated web system to facilitate personalized web searching algorithms. generic web searching often turns out impersonal and frustrating due to lack of adaptivity to user preferences. these problems can be alleviated in the presence of a solution to assist personalization in an effective manner. such a tool is presented within the context of this paper that enables personalization on the client's browser and is supported by a web service based backend system that implement a number of different personalization approaches as an option. our aim is to provide a generic platform based on web technologies a) for end-user personalization and b) for assistance in the research & development evaluation of existing or novel personalization techniques. the solution is further underpinned with novel personalization techniques. the latter have emerged as fine-grained and improved alternatives to provably efficient personalization methods previously presented in [10]. the solution altogether has been experimentally evaluated and proved effective.
splitting heuristics for disjunctive numerical constraints. numerical constraint solving techniques operate in a branch & prune fashion, using consistency enforcement techniques to prune the search space and splitting operations to explore it. extensions address disjunctions of constraints as well, but usually in a restrictive case and not fitting well the branch&prune scheme. on the other hand, ratschan has recently proposed a general framework for first-order formulas whose atoms are numerical constraints. it extends the notion of consistency to logical terms, but little is done with respect to the splitting operation. in this paper, we explore the potential of splitting heuristics that exploit the logical structure of disjunctive numerical constraint problems in order to simplify the problem along the search. first experiments on cnf formulas show that interesting solving time gains can be achieved by choosing the right splitting points.
a service architecture for sensor data provisioning for context-aware mobile applications. one of the main issues that inhibit the development of context-aware mobile applications is the lack of systematic methods for sensor data acquisition. this lack, however, is a result of the diversity of sensor data and its acquisition devices. in face of this, there is a need for general engineering solutions in order to address the common sensor data acquisition concerns. this paper presents a service-oriented architecture that allows the rapid prototyping of sensor data provisioning systems. this architecture is then applied to the healthcare domain for providing cardiac signals in the scope of a context-aware telemonitoring system. the architecture is defined by entity and behavior models through a service-oriented design (sod) language that has tool support.
crime scene classification. in this paper we provide a study about crime scenes and its features used in criminal investigations. we argue that the crime scene provides a large set of features that can be used to corroborate the conclusions emitted by the experts. we also propose a set of features to classify the violent crime considering two classes: attack from inside or outside of the scene. the classification stage is based on conventional mlp (multiple-layer perceptron) neural network and svm (support vector machine). the experimental results reveal an error rate of 30.3% (mlp), 22.8% (svm-linear), and 19.4% (svm-polynomial) using a database composed of 400 crime scenes.
special track on web technologies: editorial message. the internet and other related technologies have created an interconnected world in which information can be easily exchanged, tasks can be collaboratively processed, communities of users with similar interests can be instantly formed to achieve efficiency and improve performance, while security threats are present more than ever before. this second edition of web technologies track is intended to bring together researchers who are actively engaged both in theoretical and practical aspects of database interoperability.
an environment for the rapid development of embedded file systems. this paper describes an environment for the rapid development of embedded file systems. it has been designed to take into account embedded real-time systems concerns such as predictability and memory footprint. the environment described here uses an abstract file system (afs) to generate c source code for a custom file system (cfs) intended for a specific application. also a software tool was created to act as a front-end and to simplify the task of cfs creation. the main advantage of this environment is reduction in both cost and time needed to develop a product, which leads to a smaller time to market.
a fast and effective method to detect multiple least significant bits steganography. in this paper, we propose a fast and effective lsb steganalysis for detecting the existence of hidden message and estimating hidden message length when the embedding is performed using both of two distinct embedding paradigms in one or more than one lsb. the method is based on the analysis of image statistics and quadratic equation. compared with weighted stego-image based method, ker's method and luo et.al.'s method, the detection accuracy is high. experimental results and theoretical verification show that the proposed method is an effective method of lsb steganalysis.
ivesta: an interactive visualization and evaluation system for drive test data. drive test data (dtd) evaluation intends to provide first-hand mobile phone performance assessment such that different parties, including phone manufacturers and network providers, can review the phone and network performance, e.g., service coverage and voice quality, from different perspectives. due to many uncertainties involved in the test environments, e.g., terrain, interference, vehicle speed, and network delay, it is crucial to properly digest the dtd data such that users can draw valid conclusions like "phone a outperforms phone b in the suburb area". we argue that because of the inherent complexity of the test environments, dtd collected from the fields suffer from low quality, low integrity, high uncertainty, and low interpretability. an evaluation tool should consider all such reality issues in order to develop a practical product. for this purpose, we report, in this paper, an integrative data visualization system ivesta (<u>i</u>nteractive <u>v</u>isualization and <u>e</u>valuation <u>s</u>ystem for driven <u>t</u>est d<u>a</u>ta) for iden (integrated digital enhanced network [1]) drive test data. our objective is to project high dimensional dtd data onto well-organized web pages, such that users can visually study phone performance with respect to different factors. ivesta employs a web-based architecture which enables users to upload dtd and immediately visualize the test results and observe phone and network performances with respect to factors such as dropped call rate, signal quality, vehicle speed, handover and network delays. ivesta provides a practical test environment for phone manufacturers and network service providers to perform comprehensive study on their products from the real-world dtd.