waashk/dblp huggingface dataset:
a software architecture for ontology-driven situation awareness. human operators of large-scale control systems face the problem of information overload induced by the large amount of information provided by multiple heterogeneous and highly-dynamic information sources. situation-aware information systems support operators by the aggregation of the available information to meaningful situations. ontologies are a promising technology for realizing such systems, because of their semantically-rich kind of knowledge representation. the cross-cutting role of ontologies and the streaming character of situation awareness, however, challenge the design of an appropriate software architecture. in this paper, we propose a domain-independent software architecture based on a core ontology for situation awareness which leverages the reusability and the scalability of involved software components. this is achieved by the application of the well-known software architecture pattern pipes-and-filters. the proposed architecture is demonstrated by examples from the field of road traffic management. in addition, we contribute several lessons learned which should be helpful for developing ontology-driven information systems in general.
a new algorithm for data discretization and feature selection. data discretization and feature selection are two important tasks that can be performed prior to the learning phase of data mining algorithms and can significantly reduce the processing effort of the learning algorithm. in this paper, we present a new algorithm, called omega, for data preprocessing. our proposed algorithm performs simultaneously data discretization and feature selection. some experiments were performed to validate the effects of the preprocessing performed by the omega algorithm in the results of the c4.5 algorithm (a well-known decision tree-based classifier). the results indicates that the proposed algorithm omega is well-suited to both, data discretization and feature selection, being appropriate for data pre-processing.
efficient concept clustering for ontology learning using an event life cycle on the web. ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. specifically, clustering techniques facilitate the building of interrelationships between terms by exploiting similarities of concepts. with the rapid growth of the web, online information has become one of the major information sources. the ontology learning process where traditional clustering algorithms are involved tends to be slow and computationally expensive when the dataset is as large as the web. to address this problem, we present an efficient concept clustering technique for ontology learning that reduces the number of required pairwise term similarity computations without a loss of quality. our approach is to identify relevant terms using a computationally inexpensive similarity metric based on an event life cycle in online news articles. then, we perform more sophisticated similarity computations. hence, we can build clusters with high precision/recall and high speed. without a loss of clustering quality, our framework reduces the number of required computations from o(n2) to (n + l2) (l &laquo; n) where n is the number of candidate concepts. our experimental results show that clustering based on our similarity framework can construct concept clusters 1541.07% faster than clustering with all term pair similarity computations.
on the performance of employing presence services in p2p-based network management systems. the use of notifications to report the status of underlying communication networks has a crucial impact on the performance of the managed network itself. presence services, which are implemented using notification messages, have been designed with the objective to provide ways of delivering accurate presence information to interested parties. however, up to now, the use of presence services in the network management discipline has not been properly addressed. is this paper, we propose an architecture that introduces presence services into traditional network management processes. we evaluated, through a system prototype implementation, the feasibility of using diverse presence services solutions as management tools and compare their performance against to each other. we present the results of a set of experiments regarding the propagation delay of the two main steps of a presence service, i.e., registration and notification. those results allows a network administrator to choose which presence service solution is more adequate for the administrator's necessities, thus helping to improve the notification process.
a requirements refinement framework. requirements refinement is not only a process to derive specifications, but also a necessary means towards preparing architectural designs. in this paper, we present a novel refinement framework, comprising methods and process, to move from requirements to design. the framework consists of multiple abstraction levels capturing requirements of different kind and granularity, allows the derivation of designer and user perspectives separately, introduces stages of activities to be carried out in the process, includes refactoring-based methods to carry out the refinement, and provides a structure that allows easy traceability between requirements.
towards an integrative human pathway database for systems biology applications. while there are more than 217 online pathway databases of different coverage and quality as of september 2007, our knowledge of human pathways is still far from complete. it has been challenging to develop pathway tools and database resources that could expand the coverage of existing annotated pathway data by integrating these resources both at the syntactic and semantic levels. while developing the human pathway database (hpd), we use data warehousing techniques and a unified pathway data model to integrate a total of 1,895 pathways and 10,631 molecular entities from four different annotated and predicted pathway resources in human. hpd provides a comprehensive and integrated view linking human proteins, genes, rnas, signaling reactions, gene regulatory events for future systems biology applications. we studied pathways in the database for their merging potentials and showed a preliminary pathway merging result as 2-d clusters. we also examined pathway scale and the distribution of pathway-spanning proteins, pathway characteristics that suggest small pathways and large pathways may still be under-represented in the hpd. we also found many proteins with important energy metabolism, cell growth, and cell differentiation functions span across vast number of pathways. the raw data for hpd can be queried at: http://discover.uits.indiana.edu:8340/spathway/s_pathway/
designing interaction behaviour in service-oriented enterprise application integration. in this paper we present an approach for designing interaction behaviour in service-oriented enterprise application integration. the approach enables business analysts to actively participate in the design of an integration solution. in this way, we expect that the solution meets its integration goal and business requirements. the approach consists of four steps: (i) represent the existing services to be integrated in platform-independent models; (ii) derive the models of the goals and business requirements of the services; (iii) check whether an abstract interaction representing the integration goal may occur between the services; and (iv) if so, (recursively) refine the interaction into a realisable design. the approach is characterised by an early check on the possibility of an integration solution, clear expressions of the integration goal and business requirements, and explicit use of the descriptions of the existing services as bottom-up knowledge during refinement. to support the approach, we present a set of patterns of interaction refinement as guidelines in refining abstract interactions.
context-aware middleware architecture for vertical handover support to multi-homed nomadic mobile services. to accommodate the requirements such as high usability and personalization of 4g (mobile) networks, conventional handheld single network-interface mobile devices are evolving into multi-homed devices. moreover, owing to the recent advances in the mobile middleware technologies, hardware technologies and association with the human user, handheld mobile devices are evolving into data producers and in turn acting as nomadic mobile service (nms) providers. for these devices, a vertical handover support is essential for the improved and reliable nms delivery. also, the fulfillment of the required qos by the nms is bounded by the end-to-end qos (e2eqos) provided by the underlying heterogeneous networks. to deal with these aspects, we propose a context-aware middleware architecture supporting vertical handover for the nmss hosted on the handheld mobile devices. we emphasize the following features of the proposed middleware: 1) context-aware computing based approach which uses an extensive set of context information collected from the mobile device and a fixed network; 2) provisioning of and interaction with the end-to-end qos (e2eqos) predictions context source in the fixed network to obtain near-accurate estimation of the e2eqos at a certain geographic location and to reduce unnecessary power usage in searching for available networks.
optical flow using color information: preliminary results. optical flow cannot be completely determined only from brightness information of images, without introducing some assumptions about the nature of movements in the scene. color is an additional natural source of information that facilitates the solution of this problem. this work aims to illustrate the improvement in the optical flow estimation by using color information through experimental results.
towards a service-based middleware layer for runtime environments. natively compiled, binary-code application programs are typically thought of as executing on the "raw" operating system. however, they do in fact utilize a bare-bones middleware layer---the dynamic linker. this paper presents a service-based view of an expanded run-time environment in which the current dynamic linker is only a core service, and other middleware-type services are available to the application and its components (shared libraries). this paper then describes a prototype implementation of such an environment, called sbrt, or service-based run-time. sbrt also contains a unified event-based interface that allows for customized middleware services by means of an extension mechanism.
a location-aware information browser implemented on brew-based mobile phones. we present a method to implement a location-aware information browser on mobile phones. our location-aware information browser is designed to look for nearby hidden points of interests in mobile computing environments. the method we developed provides two benefits: the first benefit is to improve the performance of transforming and rendering a map by combining filtering techniques of a spatial database and fixed-point arithmetic techniques. our method is designed to deal with two kinds of minimum bounding rectangles to apply such conventional effective processing techniques of a spatial database to our browser. the second benefit is to handle large or long map elements in brew-based computing environments by clipping techniques of computer graphics. we clarified the feasibility and effectiveness of our method by several experiments.
special track on advances in computer simulation (acs): editorial message. computer simulation approaches have established as fundamental conceptual and practical instruments for the analysis of growingly complex systems, both for industry and business applications as well as in the scientific research context. computational models and simulators are currently employed in the most different application areas, ranging from urban modeling and planning to logistics and production, from biology to social sciences. consequently, the adopted modeling approaches and methodologies, as well as simulation project life-cycles, techniques for the evaluation and interpretation of simulation results are often very distant.
advanced preference query processing for e-commerce. travel and tourism represents the leading domain for applications in b2c e-commerce. thus, it deserves highest attention. due to insufficient search engines, however, arranging a trip on current online travel portals is often not as easy as it seems. we present a novel approach for an advanced processing of database queries dealing with individual as well as global preferences of customers. our approach also comprises the deployment of existing preference search technology to the tourism domain of electronic commerce. consequently, the tedious empty-result-effect is avoided. thereby, a novel, personalized search process delivering custom-tailored products is enabled for tourism and in general for e-commerce, respectively. a first prototype implementing our advanced search has shown promising results.
an efficient algorithm for a sharp approximation of universally quantified inequalities. this paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (qcsp) where existential quantifiers precede universally quantified inequalities on continuous domains. this class of qcsps has numerous applications in engineering and design. we propose here a new generic branch and prune algorithm for solving such continuous qcsps. standard pruning operators and solution identification operators are specialized for universally quantified inequalities. special rules are also proposed for handling the parameters of the constraints. first experimentation show that our algorithm outperforms the state of the art methods.
computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm. solving systems of polynomial equations is a classical problem of mathematics with an emerging number of modern applications, such as coding theory, robotics, computational statistics, etc. its importance is reflected by the broad literature that deals with algorithms, ranging from numerical continuation methods to exact methods based e.g. on gr&ouml;bner or border bases; see e.g. the monograph [1] and the references therein. however in many practical applications one is only interested in real solutions. the literature tailored to the problem of real solving systems of polynomials is by far not as broad.
publish/subscribe architecture for mobile ad hoc networks. publish/subscribe architectures have been widely studied and applied in wired networks. however, their deployment on mobile ad hoc networks still presents a lot of challenges. this work proposes and analyzes a solution for such networks using the nodes' movement to disseminate publications to the whole network with few transmissions. our proposal does not build dissemination trees which incur in a high cost to keep them updated due to constant changes in the topology, and does not even require beacons exchanges in order to sustain a neighborhood table. our experiments show that we are able to achieve better results than a gossip-based algorithm and other solutions found in the literature.
total order broadcast on pervasive systems. total order broadcast protocols are important tools to ensure coherence across distributed systems. contrarily to classical distributed systems, pervasive systems bring important constraints related to the performance and reliability of the network and the availability of the devices (laptops, pdas and cellular telephones). we propose in this paper a self-stabilizing group membership service that helps a token-based total order broadcast protocol to progress in a volatile environment. this group membership service is organized in two hierarchical levels so that unstable nodes are kept in the group without interfering with the total order broadcast protocol. as a result, we avoid expensive membership view changes while keeping the coherence among the nodes.
ranking with tagging as quality indicators. as more and more web documents are getting tagged, using tags to enhance the quality of retrieval has become an emerging challenge in the retrieval. in a clear contrast to traditional retrieval techniques solely focusing on content-based relevance to query keyword, we aim at enhancing the retrieval with additional contextual information obtained from tags, e.g., popularity or reliability of the document. toward the goal, this paper views a tag as a "quality indicator" and classifies tags with various characteristics adopting the taxonomy proposed in data quality modeling literatures. we then develop a unified framework for supporting arbitrary quality indicators in the taxonomy and evaluate its effectiveness and efficiency over both real-life and synthetic data.
data sharing vs. message passing: synergy or incompatibility?: an implementation-driven case study. one reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and shared, or instead is only transiently available during communication. generally speaking, approaches based on data sharing are more expressive and provide full decoupling in space and time. the alternative approach requires the simultaneous presence of the coordinated parties, but is typically more scalable. prominent examples are, respectively, tuple spaces and publish-subscribe. an open research question is whether it is possible to exploit in synergy the best of these two approaches, e.g. by implementing the more complex data sharing coordination on top of the more lightweight message passing one. in this paper, we seek an answer to this question in a pragmatic way: we analyze an implementation of the lime tuple space middleware on top of reds, an open source publish-subscribe system. our implementation-driven style of investigation forces us to face details that do not surface when reasoning in the abstract about the nature and expressiveness of the models. we report about lessons we learned in this experience, and propose an extension to the publish-subscribe model that, albeit useful per se, constitutes a more effective foundation for data sharing coordination models.
comparing keywords and taxonomies in the representation of users profiles in a content-based recommender system. this work investigates the use of keywords and classes to represent user's profiles in order to improve a content-based recommender system. the techniques were implemented and tested in a recommender system for a website that gathers commercial ads. ads are posted by individuals and contain a title and a textual description. profiles are created and maintained through the analysis of ads seen by the user during a certain period of time and may be represented by classes, keywords or both kinds. keywords are automatically extracted from the textual description of the ads. classes come from a taxonomy defined by the website. ads must be posted within a leaf class of the taxonomy. the items to be recommended are ads containing keywords associated to the user in his/her profile and/or ads classified in the leaf-classes present in the user's profile. the paper demonstrates that the combination of both techniques (keywords and classes) outperforms the use of each one separately.
a vehicular waiting time heuristic for dynamic vehicle routing problem. in the last years, the vehicle routing problem (vrp) has been receiving increasing a special attention due its importance in the distribution of products. considering demands that can appear during the service day, this work solves the dynamic vrp (dvrp) with support of the environment simulator, capable to emulate the behavior of the vehicular fleet in a geographic 2d space. this work presents two main contributions: (i) the environment simulator that can be used to standardize dvrp test cases; and (ii) a vehicular waiting time heuristic (vwth), that delays the attendance of demand with the meaning of reducing the total distance traveled by vehicular fleet. the proposed heuristic is tested by four optimization algorithms (simulated annealing, grasp, memetic algorithm and hill climbing), and submitted to statistical tests for better conclusions. the tests showed, with 95% of confidence, that the vwth is able to improve significantly the metaheuristics results.
a ubiquitous computing environment for medical education. this paper proposes a ubiquitous computing environment for medical education, whose kernel is a web-based system with collaborative tools, to support the interactions and computational tasks among different actors involved in the medical education process. in order to allow this environment to be ubiquitous, the web pages of this system are adapted, through a content adaptation architecture, so they can be accessed by a huge variety of small mobile devices (e.g., cell phones, smart phones, tablets, personal digital assistants).
information extraction from scanned documents by stochastic page layout analysis. we propose a stochastic context-free grammar for extracting information from scanned document images. the grammar is designed to disambiguate layout analysis and utilize both layout and text features. we applied this grammar to the problem of extracting bibliographic information from scanned academic papers and found that it can accurately extract information.
template design and automatic generation of controllers for industrial robots. the basic theory of supervisory control of discrete-event systems is extended with the notion of templates, which simplifies the modeling of controllers since one can work with conceptual designs. in this work, software which provides support for the new design approach is presented along with its application to a robotic testbed.
semantic web services selection improved by application ontology with multiple concept relations. being able to determine and quantify the semantic similarity between ontological concepts is a key requirement for the discovery, selection, and composition of semantic web services. especially concept similarity is calculated between different service ontologies, it is still a problem. in this paper, we propose an ontology-based approach for semantic service selection which takes into account the heterogeneity of service descriptions. the approach is based on an application ontology (ao), which is merged by different service ontologies and constructed as a semantic net with multiple concept relations. empirically the proposed method is shown to improve the quality of service selection.
on the performance of persistent connection in modern web servers. in the development of http protocol, the technique to overlap multiple http requests and replies on single tcp connection, called 'keep-alive' or 'persistent connection', has won great success. it is already verified that, persistent connection could help to save the cost of frequently creating tcp connection, and could also reduce the number of operations such like forking and destroying process. many years passed, persistent connection mechanism has been implemented widely to support all kinds of web services. however recently, dramatic changes to networking conditions and server computing capacity challenge the motivations of such mechanism and reveal some of its drawbacks. this paper models the connection management procedure in concurrent web servers with petri nets, and determines the parameters for the model by measuring a bunch of key metrics in modern web servers and networks. plus, experiments are carried out in real modern test-bed with real traffic. the analytical results yielded by the model, along with experimental results, help us to clarify the negative role that persistent connection actually plays in modern web servers, especially in those busy ones.