waashk/dblp huggingface dataset:
segmentation and reconstruction of the lung volume in ct images. the automated extraction of the pulmonary parenchyma in ct images is the most crucial step in a computer-aided diagnosis (cad) system. actually, the following step of analysis of the lung's internal structure, aimed at lesion detection and diagnosis, works on the identified pulmonary regions.in this paper we describe a method, consisting of an appropriate combination of image processing techniques, for the automated identification of the pulmonary volume. we present and discuss the results of the method application to computed-tomography (ct) examinations performed in a screening program for early detection of lung cancer.
executable declarative business rules and their use in electronic commerce. business rules are statements which are used to run the activities of an organization. in the era of electronic commerce it is important for these rules to be represented explicitly, and to be automatically applicable. in this paper we argue that methods from the field of knowledge representation can be used for this purpose. in particular, we propose the use of defeasible reasoning, a simple but efficient reasoning method based on rules and priorities. we motivate the use of defeasible reasoning, give examples, describe two case studies, and outline current and future work in our research.
graph-based automatic suggestion of relationships among images of illuminated manuscripts. scientific research on illuminated manuscripts includes the disclosure of relationships among images belonging to different manuscripts. relationships can be modeled as typed links, which induce an hypertext over the archive. in this paper we present a formal model for annotations, which is the basis to build methods for automatically processing existing relationships among link types and exploiting the properties of the graph which models the hypertext. the result of this processing is twofold: new relationships can be suggested to help users in their research work, and the existing ones can be semantically validated to check for inconsistencies.
probability vectors: a new fault-tolerant routing algorithm for k-ary n-cubes. this paper describes a new fault-tolerant routing algorithm for the k-ary n-cube using the concept of "probability vectors". to compute these vectors, a node determines first its faulty set, which contains all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. each node then calculates a probability vector, where the i-th element represents the probability that a destination node at distance i cannot be reached using a minimal path due to a faulty node or link. the probability vectors are used by all the nodes to achieve an efficient fault-tolerant routing in the network. results from a performance analysis presented below show that the new algorithm exhibits good fault-tolerance properties in terms of the achieved percentage of reachablity and routing distances.
extended internet caching protocol: a foundation for building ubiquitous web caching. internet access by nomadic users roaming on a mobile network presents a scenario of access that is substantially different from the wired network. with current web caching technology, accessing the web while mobile is slow not only because of bandwidth limitations, but also due to moving away from the home web caching proxy. furthermore, current web caching strategies ignore web access patterns during periods of mobility. studies of such scenarios are scarce. in this paper, we propose an extended internet caching protocol (x-icp), in which the proxy server of the nomadic user's newly visited network can retrieve web objects from its home network proxy server. such a scheme decreases the response time for the requests by fetching an object from a usually nearby home network rather than from the origin site. we use trace-based analysis and analytic modeling methods to evaluate x-icp. we draw several conclusions, all suggesting that x-icp would be an effective web caching approach for nomadic users, especially in wireless lan environments.
an arabic programming environment. this work presents the interface design of an arabic programming environment (ape). the environment is an attempt to arabize the user interface for programming languages under ms-windows. it consists of two interrelated parts. the first part is the arabic environment that enables users to create and edit programs in arabic. the second part is the arabic compiler. this paper describes only the first part of this project. it also states the main characteristics of the arabic language that affects this work.
a new framework for clustering algorithm evaluation in the domain of functional genomics. clustering algorithms are widely used in the computational analysis of microarray data. however, due to the lack of domain knowledge, it is often difficult to judge their performance. in this paper, we introduce a new framework for the evaluation of clustering algorithms in application to regulatory pathway reconstruction. a pilot study was conducted on the hierarchical clustering algorithm for which we obtained qualitative characterizations of the number of samples needed as well as the denseness of the subnetwork required to achieve accurate partition. for experimental scientists, this evaluation framework provides a method to select and calibrate clustering algorithms. it can also provide a confidence measure to the results of a clustering algorithm when certain restrictions on the experimental setup, such as the number of samples available, are known in advance.
knowledge discovery from doctor-patient relationship. the relationship between doctors and their patients is gaining more and more importance in the health care providing. it determines the compliance of the treatment and a part of the curative process. in the psychiatry the therapeutic relationship has even more power. therefore having a general rule that could guide doctors towards a good relation with their patients would be very useful. this paper describes experiments in automated acquisition of such a rule by means of data mining techniques. decision rules are provided to analyze the patients' satisfaction regarding the therapeutic treatment and to recognize whether a patient belongs to a psychiatric ward or not. data mining techniques show very satisfactory results on the experiments done with four different algorithms.
forming resource-sharing coalitions: a distributed resource allocation mechanism for self-interested agents in computational grids. designing efficient resource allocation mechanism for computational grids is extremely challenging because the effective agents in computational grids are inherently self-interested due to their different ownerships. providing incentive for agents to share their resource with others is the key to make computational grids realistic. the global efficiency should be generated through the interactions among agents from the bottom up. in game theory, forming coalition is such a cooperative game among self-interested agents. we develop a distributed resource allocation mechanism for computational grids by forming resource-sharing coalitions among self-interested agents through automated multiparty negotiation. this mechanism is based on a task-oriented mechanism for measuring the economic value of computational resource usage. the simulation results show that the self-interests of agents in computational grids have considerable impact on the decisions of each agent about how to allocate their resource to appropriate tasks.
editorial message: special track on data streams. advances in data acquisition hardware and embedded systems have led to the data stream era. a growing number of emerging applications varying from business to scientific to industrial ones continuously generate open-ended data streams. in practice, such data cannot be stored but must be both queried and analyzed as they arrive, discarding it right away. in many cases, we need to extract some sort of knowledge from these continuous streams that challenge the scalability of several batch-learning methods. therefore, this new field has attracted researchers from different disciplines over the past few years. examples of data streams include customer click streams, networks event logs, telephone records, large sets of web pages, multimedia data, scientific data, and sets of retail chain transactions. applications include credit card fraud protection, target marketing, and intrusion detection, for which it is not possible to collect all relevant input data. in these environments, kdd systems have to operate online under memory and time limitations.
simulating evolutionary agent communities with oocsmp. this paper describes some extensions added to the continuous simulation language oocsmp to perform agent-oriented simulation. the extensions are tested by simulating the evolution of a colony of virtual ants (vants). in this simulation, each vant is modelled as an agent and is assigned a set of genes that control some aspects of its behaviour, such as its velocity, memory, communication abilities, scepticism, etc. some emergent properties of the swarm of vants have been observed.
a new signature scheme: joint-signature. a number of asymmetrical payment methods have been developed to enable mobile users to buy goods online by charging them to their mobile phone bills by their network operators. it has been recognized that these methods must be used in conjunction with the security services of authentication and non-repudiation of the origin of the request(s) sent from a mobile user so as to prevent fraudulent actions by the network operator or any other entities. this paper presents a novel joint-signature scheme that can be used as one of the security primitives to address the above security services. the scheme enables a mobile user to securely and efficiently instruct his/er network operator for m-payment related actions. it is based on the use of the one-way hash function and traditional digital signature method, but in a collaborative manner with the network operator. the joint-signature scheme achieves the same security services as those by a traditional digital signature scheme, i.e. message origin authentication, message integrity and non-repudiation of origin, but offers lower computational cost for the mobile user. in addition, it imposes lower communication cost in comparison with proxy/server-aided signature schemes.
editorial message: special track on data streams. databases are growing incessantly and many sources produce data continuously. in many cases, we need to extract some sort of knowledge from this continuous stream of data. example include customer click streams, telephone records, large sets of web pages, multimedia data, scientific data, and sets of retail chain transactions. these sources are called data streams. the goal of this track is to convene researches who deal with decision rules, decision trees, association rules, clustering, filtering pre/post-processing, feature selection, visualization techniques, etc. from data streams and related themes.
a discrete event based simulation environment for enhanced umts 3 generation networks. this paper presents a new system level simulator that has been developed to evaluate e-umts (enhanced universal mobile telecommunication systems) 3g networks. the article describes how the simulator supports different mobility, propagation, and traffic generation models and how this simulation framework can be used to evaluate new protocols, algorithms, or resource management mechanisms. specific models and performance details for a sample scenario of a business city center are also provided.
evaluation measures for business process models. this work presents a set of measures to evaluate the structural complexity of business process models at a conceptual level, and also the general plan of a family of experiments whose aim is to validate the measures proposed. we believe that the early evaluation of business process models would provide business process management with support which would make their maintenance tasks easier. this proposal is based on the standard notation for business process modelling bpmn and on the adoption and extension of the fmesp framework.
schedulers for rule-based constraint programming. we study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. we systematically derive a scheduler for them from a generic iteration algorithm of apt [4]. we apply this study to so-called membership rules of apt and monfroy [5]. this leads to an implementation that yields for these rules a considerably better performance than their execution as standard chr rules.
framework for mining web content outliers. outliers are data objects with different characteristics compared to other data objects. exploring the diverse and dynamic web data for outliers is more interesting than finding outliers in numeric data sets. interestingly, the existing web mining algorithms have concentrated on finding patterns that are frequent while discarding the less frequent ones that are likely to contain the outlying data. this paper refers to outliers present on the web as web outliers to distinguish them from traditional outliers. web outliers are data objects that show significantly different characteristics than other web data. although the presence of web outliers appears obvious, there is neither formal definition for web outliers nor algorithms for mining them. secondly, traditional outlier mining algorithms designed solely for numeric data sets are inappropriate for mining web outliers. this paper establishes the presence of web outliers and discusses some practical applications of web outlier mining. finally, we present taxonomy for web outliers and propose a general framework for mining web content out.
mining web content outliers using structure oriented weighting techniques and n-grams. classifying text into predefined categories is a fundamental task in information retrieval (ir). ir and web mining techniques have been applied to categorize web pages to enable users to manage and use the huge amount of information available on the web. thus, developing user-friendly and automated tools for managing web information has been on a higher demand in web mining and information retrieval communities. text categorization, information routing, identification of junk materials, topic identification and structured search are some of the hot spots in web information management. a great deal of techniques exists for classifying web documents into categories. interestingly, almost none of the existing algorithms consider documents having 'varying contents' from the rest of the documents taken from the same domain (category) called web content outliers. in this paper, we take advantage of the html structure of web and n-gram technique for partial matching of strings and propose an n-gram-based algorithm for mining web content outliers. to reduce the processing time, the optimized algorithm uses only data captured in <meta> and <title> tags. experimental results using planted motifs indicate the proposed n-gram-based algorithm is capable of finding web content outliers. in addition, using texts captured in <meta> and <title> tags gave the same results as using text embedded in <meta>, <title>, and <body> tags.
design and implementation of a context-aware decision algorithm for heterogeneous networks. wireless networks and mobile terminals are evolving towards being heterogeneous. in this environment, intelligent handover decision, beyond traditional ones that are based on only signal strength, is needed so that terminals can select the best option available from diverse networks and services as per user requirements. in the process, it would enable user applications to switch automatically between active interfaces that best suit them based on application requirements and interface capabilities and to use multiple radio interfaces simultaneously ensuring the optimum usage of the network resources available to the terminal. to fulfill the above requirements, this paper proposes the design and implementation of a context-aware vertical handover decision algorithm suitable for multimode mobile devices in heterogeneous networks based on the analytic hierarchy process (ahp).
making xpath reach for the web-wide links. opting for link semantics in xml is almost like hyperlinks for html documents. xlink describes a standard way to add hyperlinks to an xml document. the current xpath technologies are restricted to follow id/idref(s) links for intra-document navigation only. we investigate the lightweight directory access protocol (ldap) that offers a rich collection of primitives to express links among distributed data collections in the network, and facilities to follow links when searching. in virtue of querying the underlying ldap model by referrals, we developed an extended xpath processor that is capable of addressing links of any type (idref(s), xlink) embedded in xml data on the web. links may be inter-document, or even traverse across different local or remote servers. we describe the internal ldap data representation and query model used by the processor for the storage and querying in xpath of xml documents based on links, and provide examples to illustrate them. we complement the discussion with experimental analyses that prove the efficiency of our query evaluation techniques. the latter confirms the relevance of our approach for applications that need to interact with interlinked xml document networks in an xpath-like fashion.
adaptive dynamic run-length coding for image segmentation. in this study, an adaptive image segmentation algorithm based on a modified dynamic window-based gray-level run-length coding (dw-rlc) is developed. we propose an adaptive method for determining the range which is used in the (dw-rlc) algorithm for image segmentation. first, the modes are estimated and identified from the image histogram automatically. secondly, the adaptive range (r) is calculated using the statistics estimated from the mode distribution. then, the actual interval for the segmentation is updated based on the seed pixel value and the adaptive range (r). the proposed adaptive algorithm can be categorized as a region growing method. the proposed method is compared with the mean shift and k-means algorithms. this method improves the dw-rlc algorithm by making it less dependent on the randomly chosen range for segmentation, hence more stable.
role-based authorization in decentralized health care environments. the formation of a distributed system is based on a collection of distributed components and it requires the ability for components to exchange syntactically well-formed messages. to simplify network programming for such interactions and to realize security services for those components, we need a component-based software architecture that enables software components to communicate directly over a network in a reliable and efficient manner. one of those models is distributed component object model (dcom) which is used for interacting with distributed components within the local intranet. in this paper, we overview an aspect of dcom concerning software architecture and access control. and we describe the concept of role-based access control (rbac) which began with multi-user and multi-application on-line systems pioneered in the 1970s. also we investigate how we can enforce the role-based access control as a security provider within the critical environment such as health care industry accessing distributed components legitimately. we demonstrate the feasibility of our approach through a proof-of-concept prototype implementation.
towards reliable osgi framework and applications. upcoming ubiquitous computing systems are required to operate in dynamic, diverse, unverified, and unpredictable operating environment. the osgi (open service gateway initiative) framework employs the service-oriented approach and the java classloader architecture for the runtime service deployment, that are well suited to the dynamic environment envisioned for home networking and ubiquitous computing. however, the current osgi framework does not provide full reliability measures, especially for failure conditions such as network, device, and application failures. this paper analyzes software reliability issues in osgi framework and proposes a proxy-based reliable extensions. the design concept is implemented and partly tested on an open source osgi platform, oscar, for the smart home residential gateway test-bed.
privacy-preserving demographic filtering. the use of recommender systems in e-commerce to guide customer choices presents a privacy protection problem that is twofold. we seek to protect the privacy interests of customers by trying to keep private their identity and demographic characteristics, and possibly also their buying preferences and behaviour. this can be desirable even if anonymity is used. furthermore, we want to protect the commercial interests of the e-commerce service providers by allowing them to make recommendations as accurate as possible, without unnecessarily revealing valuable information they have legitimately accumulated, such as market trends, to third parties.in this paper, we concentrate on recommender systems based on demographic filtering, which make recommendations based on feedback of previous users of similar demographic characteristics (such as age, sex, level of education, wealth, geographical location, etc.). we propose a system called alambic, which adequately achieves the above privacy-protection objectives in this kind of recommender systems. our system is based on a semi-trusted third party in which the users need only have limited confidence. a main originality of our approach is to split user data between that party and the service provider in such a way that neither can derive sensitive information from their share alone.
a branch-price-and-propagate approach for optimizing igp weight setting subject to unique shortest paths. an interior gateway protocol (igp) routes internet end-to-end traffic via the shortest paths according to a set of igp weights assigned to the network links. these weights, which can be re-set by the administrator, uniquely determine the traffic routes and thus the network performance. assigning and provisioning the igp weights incurring the minimum network congestion, is a common practice in traffic engineering. motivated by an application, this paper considers the problem of optimizing the igp weights so that the shortest paths are unique in the network. despite its relevance in the telecoms sector, the problem poses considerable modelling and optimization challenges which have yet to be addressed. we develop a constraint model for the problem, and show that even small instances are too difficult for traditional optimization approaches. our main contribution is a new hybrid optimizer that combines constraint programming and cut/column generation in order to exploit the model structure. our optimizer succeeds in solving most of a set of realistically sized benchmarks.
integrating similarity-based queries in image dbmss. until recently, issues in image retrieval have been handled in dbmss and in computer vision as separate research works. nowadays, the trend is towards integrating the two approaches (content- and metadata-based) for multi-criteria image retrieval. however, most existing works and proposals in this domain lack a formal framework to deal with a multi-criteria query. in this paper, we introduce a formal framework to address this subject of image retrieval under an ordbms model. we first propose an image data repository model interoperable with current popular standards. then, we present an algebraic formalism for content-based operators on image database. we study the properties of these operators and discuss query optimization issues. to demonstrate the use of our algebra, we implemented an extension of our prototype called emims. experimental evaluations on our proposed query optimization techniques used in emims are presented here.