waashk/dblp huggingface dataset:
a study for provisioning of web-based services to the end-user. although qos provision has been researched extensively for b-isdn (atm based) networks and it is also under research for ip networks (internet), until recently there was no real service environment to provide such qos to end users. demonstrators and laboratory experiments aimed mainly at proving specific technologies and architectures. recent advances in the commercialisation of technology and respective standardisation effort have changed the scenery. end to end networks, capable of qos support, are in a maturity status that will enable commercial deployment within the next few years. still, there are no applications to take advantage of such services. it would be most desirable to enhance the way users use current applications (such as the established web browser), than to try to introduce new application s/w. this paper proposes a method based on the open service gateway initiative (osgi) specification [1] that enables the quality of service (qos) for bandwidth demanding applications such as multimedia applications, by introducing s/w modules as enhancements into the existing applications. this method targets to the end-user, when using the network topolgy that is being standarised by the full services access network (fsan) [2].
schemata theory for the real coding and arithmetical operators. the schemata theory analyzes the effect of the selection process, mutation and crossover over the number of individuals that belong to a given schema, within generations. this analysis considers, in its original form, the binary coding and operators. in this article, we present an analogous study, focusing on the real number coding and arthmetical operators. unfortunately, the conventional schema definition is tightly dependent on discrete alphabets. therefore, following a generalization of the concept of schema, we present a particular definition that suits better the continuous domain. using this new definition, we reach an expression similar to the fundamental theorem of genetic algorithms [6] valid for the real coding of chromosomes.
a memory subsystem with comparator arrays for main memory database operations. we propose hardware supported intelligent memory access schemes for high performance database operations. a comparator array is installed in a memory module to help database operations, which allows simple predicate matching to be processed in the memory to reduce traffic between the cpu and the main memory. in this paper, we evaluate the query processing performance using introduced memory access schemes and show that hardware support memory accesses improve the performance of the main memory database operations.
policies translation for integrated management of grids and networks. computing grids require the underlying network infrastructure to be properly configured in order to have appropriate communications among the grids' nodes. the management of networks and the management of grids are currently executed by different tools operated by different administrative personnel. eventually, the grid communication requirements will need corresponding support from the network management tools, but such requirements are fulfilled only when grid administrators manually asks network administrators for corresponding configurations. in this paper we propose a policy translation mechanism that creates network policies given grid requirements expressed in grid policies. we also present a system prototype that allows (a) grid administrators to define grid policies, and (b) network administrators to define translating rules. these rules are used by the proposed translation mechanism to generate the necessary underlying network configuration policies.
cluc: a natural clustering algorithm for categorical datasets based on cohesion. we propose a clustering algorithm for categorical datasets, called cluc (clustering with cohesion), which uses a novel similarity measure, called cohesion, to determine the degree with which items/objects stick to clusters. we have implemented cluc and carried out extensive experiments on real-life and synthetic datasets. the results of experiments and their analyses indicate that cluc generates high quality clusters in that they conform to expert's opinion. our experiments on large synthetic data confirm that cluc is scalable when the dataset grows in the number of objects and/or dimensions. we also repeated the experiments with different orders of the items in the datasets. the results show that the proposed algorithm is order insensitive
terminology-driven mining of biomedical literature. in this paper we present an overview of an integrated framework for terminology-driven mining from biomedical literature. the framework integrates the following components: automatic term recognition, term variation handling, acronym acquisition, automatic discovery of term similarities and term clustering. the term variant recognition is incorporated into terminology recognition process by taking into account orthographical, morphological, syntactic, lexico-semantic and pragmatic term variations. in particular, we address acronyms as a common way of introducing term variants in biomedical papers. term clustering is based on the automatic discovery of term similarities. we use a hybrid similarity measure, where terms are compared by using both internal and external evidence. the measure combines lexical, syntactical and contextual similarity. experiments on terminology recognition and structuring performed on a corpus of biomedical abstracts are presented.
fair certified e-mail delivery. communication by e-mail has become a vital part of everyday business and has replaced most of the conventional ways of communicating. important business correspondence may require certified e-mail delivery, analogous to that provided by conventional mail service. this paper presents a novel certified e-mail delivery protocol that provides non-repudiation of origin and non-repudiation of receipt security services to protect communicating parties from each other's false denials that the e-mail has been sent and received. the protocol provides strong fairness to ensure that the recipient receives the e-mail if and only if the sender receives the receipt. the protocol makes use of an off-line and transparent trusted third party only in exceptional circumstances, i.e. when the communicating parties fail to complete the e-mail for receipt exchange due to a network failure or a party's misbehaviour. considerations have been taken in the protocol design to reduce the use of expensive cryptographic operations for better efficiency and cost-effectiveness.
simulation of a distributed recommendation system for pervasive networks. new networks based on short-range radio are emerging where mobile devices interact in a spontaneous and short-lived fashion. such pervasive networks involve devices approaching and finding each other, interacting to exchange some information or use some shared service, before disconnecting and leaving radio range. as such, they involve lots of potentially risky interactions with strangers. due to the lack of any infrastructure in these networks, using a distributed recommendation system to improve security is an attractive option. this paper describes a simulation of a simple distributed recommendation system running in such a network. these networks can be modeled as social networks and the simulation builds on an existing algorithm that has been shown to model social networks accurately. the results of the simulation suggest that with a relatively small overhead, the trust information can move effectively in such networks and the system can deliver a substantial decrease in the level of risk these spontaneous interactions involve.
the necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors. in this paper, we introduce a new interconnection network, namely the necklace-hypercube, based on the binary cube with an array of processors (as a necklace of processors) attached to each two adjacent nodes of the hypercube network. topological properties of the proposed network are studied. some important basic operations such as optimal routing and vlsi layout in necklace-hypercubes are also addressed here. moreover, a comparison between the necklace-hypercube and some other popular networks is conducted. the comparison is based on vlsi layout, scalability, and other static topological properties. area-efficient vlsi layout and network scalability of the necklace-hypercube make it an attractive alternative to the well-known hypercube network topology, while keeping most of desirable properties of the hypercube.
email classification for contact centers. the explosive growth of the internet has made email an integral part of business communication. therefore, business customer service centers, or contact centers, are processing larger amounts of email interactions with customers. in this paper we discuss a preliminary email routing and classification system that filters and classifies incoming email messages upon their content. a module first attempts to identify and filter those email messages that do not require immediate (if any) responses. we call such email messages single messages. the emails that do require immediate responses are called root messages. a second module classifies messages in categories that characterize the type of interaction between the contact center operators and the customers. emails that are involved in such interactions form a thread and can be classified broadly into one of three categories: root, inner, and leaf. root messages are those that start a thread while a leaf message is the final email sent in an interaction. all other emails in the interaction are considered to be inner messages.
basic components for constraint solver cooperations. we propose a predefined set of basic components for designing and implementing constraint solver cooperations and solver cooperation languages. combining these components into patterns enables one to manage computation, control, and coordination needed for solver cooperations. our framework has been implemented with the chr language. we then used it to implement some cooperation primitives, and some constraint propagation with cooperative components.
learning the risk board game with classifier systems. the goal is to produce agents that are able to play the board game efficiently. classifier systems (cs) were chosen to learn the task at hand. cs were used to learn how to classify a set of (state, action) pairs. these pairs represent a game situation and the action a sensible player should execute when faced with such a situation. results show that the cs agents perform poorly when compared to humans, but can hold their own in specific situations against computer agents with a fixed, pre-programmed strategy.
a new table interpretation methodology with little knowledge base: table interpretation methodology. in this paper, a new methodology for table-form interpretation with little previous knowledge is presented. the first module performs the identification of line intersections in a table-form, the second module detects and corrects wrong intersections produced by fault intersection segments or by table artefacts (smudges, overlapping of handwritten data and fault segments). the third module performs the table-form cell extraction. the features used to interpret the table-form are directly extracted from the image itself by means of morphological tools. the evaluation of the efficiency is carried out from a total of 305 table-form images. experiments showed significant and promising results. the proposed approach reached a success rate over than 87% on average. the main advantage of the proposed methodology is requiring little knowledge from documents, being able to apply for a table-form majority.
a generic serializer for mobile devices. in this paper we describe a serializer component completely realized in .net managed code, able to run on a stripped versions of the .net platform (e.g., compact framework) and still generic enough to be used on .net or other cli compatible frameworks. such a component is not normally provided with stock libraries in their compact version, since its implementation is quite tricky when relying on reduced reflection services. however, this component makes easier the development of distributed applications involving mobile devices and desktop computers or mainframes. our implementation faced several problems ranging from lack of features in the base classes to the inter-framework portability problem, since the same object could have different implementation. the resulting product shows satisfactory performance figures and has a modular and flexible architecture.
finding optimal linear measures for feature selection in text categorization. a common way of performing feature selection in text categorization consists in keeping the features with highest score according to certain measures, like linear ones which have been successfully proposed in [1]. its disadvantage is that they need to previously determine the parameter which defines them. until now, this drawback has been overcome by taking manually a set of values for such parameter. this paper proposes a method for automatically determining optimal values of the parameter by means of solving a univariate maximization problem.
order relations and rigor in computing. rigor in computing depends in many ways on the integrity of order relations. commonly used hardware floating-point arithmetic can destroy that integrity. an available remedy is discussed with examples.
integrative approach for computationally inferring protein domain interactions. the current need for high-throughput protein interaction detection has resulted in interaction data being generated en masse, using experimental methods such as yeast-two-hybrids and protein chips. such data can be errorful and they often do not provide adequate functional information for the detected interactions; it is therefore useful to develop an in silico approach to further validate and annotate the detected protein interactions. given that protein-protein interactions involve physical interactions between protein domains, domain-domain interaction information can be useful for validating, annotating, and even predicting protein interactions. however, large-scale experimentally determined domain-domain interaction data do not exist; as such, we describe an integrative approach to computationally derive putative domain interactions from multiple data sources, including rosetta stone sequences, protein interactions, and protein complexes. we show the usefulness of such an integrative approach by applying the derived domain interactions to predict and validate protein-protein interactions.
a space aware agent-based modeling process for the study of hierarchical complex systems. complex systems are composed of many heterogeneous elements organized in a hierarchical way, whose mutual interactions make emergent collective behaviors to appear at the highest levels of observation. in biology, as shown by the integrative physiology theory [2], space and geometry have a significant role in the simulation results. in this paper we expose a process, and its set of formalisms, for modeling and simulation of complex system, going from structural modeling to dynamic simulation while integrating geometrical information in behavior study. our solution relies on three kind of concepts and techniques: hierarchical graphs for modeling the system structure and organization, zeigler's formalisms for the specification of components [6] and a space aware multi agent system for agent-based simulation.
a fault-tolerant directory service for mobile agents based on forwarding pointers. a reliable communication layer is an essential component of a mobile agent system. we present a new fault-tolerant directory service for mobile agents, which can be used to route messages to them. the directory service, based on a technique of forwarding pointers, introduces some redundancy in order to ensure resilience to stopping failures of nodes containing forwarding pointers; in addition, it avoids cyclic routing of messages, and it supports a technique to collapse chains of pointers that allows direct communications between agents. we have formalised the algorithm and derived a fully mechanical proof of its correctness using the proof assistant coq; we report on our experience of designing the algorithm and deriving its proof of correctness. the complete source code of the proof is made available from the www.
formal modeling and quantitative analysis of klaim-based mobile systems. klaim is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architecture configuration are key issues. in this paper we propose stocklaim, a stochastic extension of cklaim, the core subset of klaim. cklaim includes process distribution, process mobility, and asynchronous communication. the extension makes it possible to integrate the modeling of quantitative aspects of mobile systems--- e.g. performance---with the functional specification of such systems. we present a formal operational semantics of stocklaim, which associates a labeled transition system to each stocklaim network and a translation to continuous time markov chains for quantitative analysis. we also show how stocklaim can be used by means of a simple example, i.e. the modeling of the spreading of a virus.
a negotiation support system based on a multi-agent system: specificity and preference relations on arguments. in this paper, we propose a negotiation support system based on a multi-agent system. each agent assists a user in multi-criteria decision making and negotiates according to this decision-modelling with other agents, each of them representing a user. moreover agents assist users in the debate to negotiate a joint representation of the problem and automatically justify proposals with this joint representation.
induction of compact decision trees for personalized recommendation. we propose a method for induction of compact optimal recommendation policies based on discovery of frequent item-sets in a purchase database, followed by the application of standard decision tree learning algorithms for the purposes of simplification and compaction of the recommendation policies. experimental results suggest that the structure of such policies can be exploited to partition the space of customer purchasing histories much more efficiently than frequent itemset discovery algorithms alone would allow.
optimized transitive association rule: mining significant stopover between events. we consider a problem of finding optimized transitive association rules. a transitive association rule is a transitive sequence of different events. each of two consecutive events in a transitive association rule is a conventional association rule. transitive confidence is the product of confidence values of all the association rules in the event sequence. the optimized transitive association rule from a cause event to an effect event is the optimal sequence of events whose transitive confidence is maximum among all possible sequences from the cause to the effect. in this paper, we present space efficient algorithms for computing all of the optimized transitive association rules between events, whose transitive confidence is not less than a user specified minimum confidence value.
a security specification verification technique based on the international standard iso/iec 15408. this paper proposes a security specification verification technique based on the international standard iso/iec 15408. we formalized the security criteria of iso/iec 15408 and developed the verification technique of security specifications based on the formalized criteria with formal methods. with the technique, one can formally verify whether or not specifications satisfy the security criteria of iso/iec 15408. ambiguity and/or oversight about security in specifications written in natural language can also be detected.
community viewer: visualizing community formation on personal digital assistants. mobile computing has been mainly utilized for point-to-point communication services, such as e-mail or fax among people. to advance this field, the challenge is to encourage group communication by providing information that encourages community formation. as the first step towards this goal, we experimentally implemented the community viewer, which dynamically visualizes the communication interaction among people in the community. to design the community viewer, we introduced (1) the party room metaphor, which provides a virtual place for representing various community activities, and (2) the reflector icon, which reflects the activity of the corresponding individual while protecting his/her privacy. the static relationship among people and their dynamic activities are displayed in the spatial arrangement of reflector icons in the party room. we report our experiments on implementing and testing the community viewer in an international conference using 100 personal digital assistants.
using agents for multi-target search on the web. in this paper we present an approach to support multi-target search over a set of web nodes. multi-target search allows users to specify multiple interdependent search objectives. such objectives are then fulfilled by transparently contacting multiple information sources. we present a runtime platform and a language supporting extraction and assembly of information according to users' needs. the language is based on a xml query language and adapts it to the case where information is obtained by aggregating parts distributed over multiple sites. the platform is based on mobile agents and acts as an intermediary between users and information providers.
a framework for content-based image retrieval fully exploiting the semantics of annotation. we present a framework and an application for semantic-based retrieval of images. our approach adopts a two-level ontology structure in a subset of owl-dl. in the core ontology only generic spatial relations are represented, while domain ontologies are specific for the image collection. the approach allows semantic-based relevence ranking and results explanation for query refinement, by exploiting standard and non-standard inferences in description logics.
editorial message: semantic-based resource discovery, retrieval and composition track. a resource is a broad term comprising goods in electronic commerce, information available in remote sites, services announced through internet, learning objects, digital images, to mention a few. whatever their nature, the term "resource" is used in a general sense for whatever might be identified atomically and univocally. hence, the problem of resource matching and retrieval arises in several scenarios.
semantic matchmaking in a p-2-p electronic marketplace. matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are peers in the transaction. peer-to-peer (p-2-p) e-commerce calls for an infrastructure treating in a uniform way supply and demand, which should base the match on a common ontology for describing both supply and demand. knowledge representation --- in particular description logics --- can deal with this uniform treatment of knowledge from vendors and customers, by modelling both as generic concepts to be matched. we propose a logical approach to supply-demand matching in p-2-p e-commerce, which allows us to clearly distinguish between exact, potential and partial match, and to define a ranking within the categories. the approach is deployed in a prototype system implemented for a particular case study (but easily generalizable) and is based on classic, a well-known knowledge representation system.