waashk/dblp huggingface dataset:
data driven approach to designing minimum hamming distance polychotomizer. a polychotomous classifier assigns an observation to one of the k categories with k > = 3. multiple binary classifiers (k = 2) such as the popular support vector machines can be combined to achieve multi-class classification. commonly used approaches include the one-vs-others scheme and the one-vs-one (pairwise coupling) scheme. while literature reported better performance from pairwise coupling than one-vs-others, the number of base learners required by pairwise coupling is quadratic in k. alternatively, error correcting output codes (ecoc) provides a more general framework for designing polychotomizers. it associates each class with a codeword, which provides the capability to unify the traditional schemes. however, the design of an effective "coding matrix" remains an open problem. we study one kind of ecoc polychotomizer that decodes using minimum hamming distance. we propose a novel data-driven way to design the codewords based on inter-cluster distance. it provides a systematic way to extend the traditional schemes and construct effective polychotomizers. experiments are conducted on synthetic data and real world applications including uci repository problems and cenparmi handwritten numerals. experiments show that the proposed scheme can achieve competitive accuracy compared with both traditional schemes, and the number of base learners is typically much less than the requirement of the pairwise scheme.
measuring structural complexity for class diagrams: an information theory approach. in the object-oriented analysis phase, class diagrams are used to represent the static structure of objects in a system and the kinds of static relationships that exist among them, which lay the foundation for all later design and development. therefore, their complexity has a significant impact on the quality of the ultimate system. for quantifying the structural complexity of a class diagram precisely, this paper presents a structural complexity model called weighted class dependence graph (wcdg), in which almost all relationships among classes/interfaces that can be found during the object-oriented analysis phase are represented and their degrees are characterized by weights. based on the wcdg, this paper depicts the occurrence of the outgoing and incoming edges by two discrete random variables and then uses entropy distance to derive a novel structural complexity measure called edc. we believe that edc is flexible and could evaluate the structural complexity of class diagrams more objectively.
recognizing the relations between web pages using artificial neural network. semantic web shows us the potential infrastructure of the next generation web. web information will be understandable to machines in this infrastructure. our research work has the aim of embedding machine-understandable semantic information in ordinary html files automatically given the domain ontology. we focus on automatically acquiring the instances of concepts and relations defined in domain ontology from web pages. this paper describes how to recognize the relation between web pages (a kind of relation instance) by using artificial neural network (ann). the input vector of ann is determined by the type of web pages, the number and type of hyperlinks between the web pages, and the similarity in web pages' contents. we also show the initial results got by our prototype system.
streaming of divx avi movies. in recent years the mpeg-4 iso compression standard has gained much attention. with its high compression ratio it promises to make broadband streaming more feasible. however, currently there are only a limited number of fully iso standard compliant mpeg-4 systems widely available (apple's quicktime 6 is one of the first). some partial implementations, such as the mpeg-4 style codec "divx" are popular for encoding video content into avi (audio video interleave) files. the avi file format was originally not intended for streaming. in this report we document our efforts to enable streaming of divx avi files across broadband ip based networks. this will allow the large number of existing avi files to be made available in streaming applications.
coordination-based distributed constraint solving in dice. dice (distributed constraint environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. the framework is implemented using the manifold coordination language, and delivers coordination services to these components. the coordination services implement existing protocols for constraint propagation, termination detection and splitting of constraint satisfaction problems. dice combines these protocols with support for parallel search and the grouping of closely related components into cooperating solvers. in addition to these facilities, the paper describes the dice framework architecture, and gives a report on its implementation.
an agent model for fault-tolerant systems. this paper describes the use of fault tolerance in a multi-agent system. such an approach is based on the modeling of autonomous agents with planning capabilities. these capabilities are used by the agent to recover from faults occurring in its surrounding environment, e.g. hardware faults, or in its internal representation thereof, e.g. software faults. the expected fault-tolerant behavior is tested using fault injection either in the system described by the agent or in the environment in which the agent (system) is embedded into.
on the semantics and expressive power of datalog-like languages for np search and optimization problems. it has been shown that np (decision, search and optimization) problems can be expressed by means of datalog (datalog with unstratified negation) queries under stable model semantics. anyhow, the use of unrestricted negation is often neither simple nor intuitive and, besides, datalog does not allow to optimize queries and to discipline the expressive power. this paper analyzes the power of datalog-like languages in expressing np search and optimization problems. in more detail, in this paper we study the expressive power of several languages obtained by extending positive datalog with intuitive and efficient constructs, i.e. stratified negation, constraints and (exclusive) disjunction. finally, we investigate a further restricted language, called np datalog, which uses disjunction only to define (nondeterministically) partitions of relations and which, in addition, captures the power of datalog in expressing search and optimization problems.
component based trust management in the context of a virtual organization. one of the difficulties in evaluating the trustworthiness of an object in a virtual organization is the lack of sufficient information to study how the object was formed and to what level its components should be trusted. if a subject could be provided with detailed information about the ingredients of a compound object, then the subject would be able to evaluate the trust level of that compound object with higher confidence. this paper introduces a scheme using labels associated with each object within the domain of a virtual organization to facilitate trust management. each label supplies certain information regarding the originality of the associated object. thus, partial trust (also called component trust) can be integrated to evaluate the composite trust of the compound object. re-labeling enables object information update to accommodate the dynamic nature of a virtual organization. indirect trust between two subjects can be calculated based on a trust network. different subjects may view the same object with different trust values because they trust the components of the object to different degrees. this model uses recommendations supplied by other subjects to provide a dynamic and flexible way to adjust the trustworthiness of an object for a certain subject.
information trustworthiness evaluation based on trust combination. publishing information in a virtual organization (vo) has become too easy due to low barriers; hence development of novel mechanisms to assess the quality of collected information has become a necessity. an evaluator makes such an assessment based on the trust he/she places on the information. this paper presents a model for evaluating information trustworthiness in a data-intensive vo.when some information is derived from various data items gathered from multiple sources (each data item is called an object as used together with the term, subject), it is possible that no data value (called a version of the object) satisfies an evaluator's requirement with regard to information quality, if they are evaluated separately. according to the principle of object trust combination, if the final values of an object calculated by using significantly different methods are similar, then the evaluator places higher level of trust in the results. intuitively, different versions of the same object that are calculated in different ways but have similar values provides "multiple-proofs" towards their correctness. we assume that a subject has no conflicting information on a given object.this paper uses a formal data structure to represent how a given piece of information (object version) has been formed and develops algorithms (see section 4) to compare the component structure similarity/dissimilarity between two object versions. this helps in calculating the final trust values of the object.
a new local consistency for weighted csp dedicated to long domains. the weighted constraint satisfaction problem (wcsp) is a soft constraint framework with a wide range of applications. most current complete solvers can be described as a depth-first branch and bound search that maintains some form of local consistency during the search. however, the known consistencies are unable to solve problems with huge domains because of their time and space complexities. in this paper, we adapt the 2b-consistency, a weaker form of arc consistency well-known in classic csps, into the bound arc consistency and we provide several algorithms to enforce it.
a dissimilarity measure for alc concept descriptions. this work presents a dissimilarity measure for description logics that are the theoretical counterpart of the standard representations for ontological knowledge. the focus is on the definition of a dissimilarity measure for alc concept descriptions, based both on the syntax and on the semantics of the descriptions. an extension of the measure is proposed for involving individuals and then for evaluating their dissimilarity.
days mobile: a location based data broadcast service for mobile users. location dependent wireless data dissemination has become an integral part of our day-to-day activities. most available applications are actually location aware which find restaurants, hotels, and millions of other points of interests (poi). recent advances in global positioning systems (gps) technology has led to the development of smart and efficient navigation systems with voice prompted turn by turn directions to the destination. deployment of wireless broadband services like evolution data optimized (evdo) has motivated the development of ubiquitous data distribution systems or wireless broadcast of location based services (lbs). days (data in your space) mobile discusses a broadcast based lbs which tends to decrease access latency [4] for location dependent data (ldd) when the number of mobile users is significantly large. we create a broadcast platform to disseminate commonly used ldd like weather, traffic, stocks, flight information, etc., and develop and deploy a java based mobile application in a mobile device which accesses the broadcasted ldd. our experiments and results show that a broadcast based lbs can be highly efficient as compared to the present generation of request-response type lbs.
software product line evolution method based on approach. continuing optimal product line development needs to evolve core assets in response to market, technology or organization changes. in this paper, we propose a product line evolution method based on the kaizen approach. kaizen is a continuous improvement method that is adopted in japanese industry. the important points of the kaizen are to prepare a work standard and continue to improve processes by correcting the differences between the standard and actual results. our core asset kaizen method provides a standard that includes core asset types based on simple metrics, kaizen patterns representing expertise, and kaizen processes for continuous improvement.
formal modelling and verification of a component model using coloured petri nets and model checking. component based software engineering has been claimed as a suitable approach to improve the flexibility and reuse in software development. in this context, the compor infrastructure provides mechanisms to promote the dynamic composition of software systems, addressing applications with support for unanticipated requirement changes. in this paper, the formal modelling and verification of the compor component model is presented. hierarchical colored petri nets are used for modelling and simulation, purposing to show the correct behavior for some scenarios. model checking is used to prove that the scenarios analyzed with simulation are correct for all possible behaviors of the model.
representing organizational competencies. business activities within the organization are performed by a number of human or automated actors. for the organization to adapt to internal or external changes it must be able to understand how and why actors are related to and assigned to processes. this requires a consistent representation of the services required by the organization's processes and those provided by its actors. this paper focuses on defining the concepts that allow structurally aligning human actors and business processes through the description of the organizational competencies required to perform processes' activities. these structures can then be used dynamically within a marketplace-based model, supporting the management of actors and activities according to the supply and demand of competencies.
selecting a distributed agreement algorithm. when component parts of distributed systems need to reach agreement, arriving at consensus is difficult if some components don't behave properly. the byzantine generals problem described by lamport and others exemplifies the difficulty. in a real situation, components don't know which of their peers are faulty and hence they cannot apply the algorithms of lamport et al, nor even decide if a suitable algorithm exists. this paper discusses options available in this situation and describes how a good expectation of arriving at a consensus can be achieved without knowing for certain which or how many participants are behaving badly.
on the stochastic constraint satisfaction framework. stochastic constraint satisfaction is a framework that allows to make decisions taking into account possible futures. we study two challenging aspects of this framework: (1) variables in stochastic csp are ordered sequentially, which is adequate for the representation of a number of problems, but is not a natural choice for the modeling of problems in which the future can follow different branches (2) the framework was designed to allow multi-objective decision-making, yet this issue has been treated only superficially in the literature. we bring a number of clarifications to these two aspects. in particular, we show how minor modifications allow the framework to deal with non-sequential forms, we identify a number of technicalities related to the use of the sequential ordering of variables and of the use of multiple objectives, and in addition we propose the first search algorithm that solves multi-objective stochastic problems in polynomial space.
raas: a reliable analyzer and archiver for snort intrusion detection system. one of the primary challenges in ids alerts analysis is controlling and archiving the huge amount of alerts that have been triggered mainly in attack periods. we have developed a self-adaptive controlling mechanism which archives the snort generated alerts in a well-formed abstracted format. an appropriate hashing technique along with a full-automated time-based hierarchical archiving approach has been used to reach this end. the developed system prevents the snort database size to grow uncontrollably and unexpectedly. results obtained from experiments and test cases show that especially in critical attack situations the system responds to queries well in a reasonable amount of time. the developed analyzer with new archiving approach is also able to compress the generated alerts effectively and generate statistical reports fast. the developed system is platform independent and can be deployed on mid-range servers and workstations. also employing it does not require much degree of security expertise.
query optimizing on a decentralized web search engine. currently, most web search engines perform search on nearly a whole copy of the web corpus. there are also tools to add search functionality to a single site. nonetheless, there is little research into search related to online communities: set of related websites or weblogs. to fill this gap, a peer-to-peer search engine is presented in this paper. this p2p search engine is designed to provide small- and middle-scale online communities such as blog sites and news sites the ability to perform text search within the community. it organizes nodes on a distributed hash table (dht) based peer-to-peer network. communities are formed in a self-organizing style. p2p ir systems may cause increased internal traffic among nodes in answering a multi-term query. in this paper, we focused on this issue and proposed several techniques to optimize the multi-term query process in a p2p framework. our proposed algorithms are evaluated by simulation. the simulation results show that our proposed algorithms have good scalability and can improve performance of the system by about two orders of magnitude in the best case.
-bound gsi: a flexible database replication protocol. several previous works have proven that there is no way of guaranteeing a snapshot isolation level in symmetrical replicated database systems without blocking transactions when they are started. as a result of this, the generalized snapshot isolation (gsi) level was defined, relaxing a bit the freshness of the snapshot being taken when a transaction is initiated in its local replica. this enhances performance, since transactions do not need to get blocked, but in some cases will increase the abortion rate. this paper proposes a flexible protocol that is able to bound the degree of snapshot outdateness from a relaxed gsi to the strict one-copy equivalent si. additionally, it proposes an optimistic solution where transactions do not block, and only need to be re-initiated when their optimistic start fails. such re-initialization is made very soon and only rolls back the first transaction accesses, without waiting for the transaction completion. finally, if 1csi is not enough, this protocol is also able to manage transactions with serializable isolation, if such a level is requested.
applying ontology in architecture-based self-management applications. context-awareness is the premise of self-management applications. in this paper, a middleware for adaptive coordination (mac) architecture is proposed. it supports the cycle from modeling and reasoning about the context knowledge to planned architecture-based self-management actions. one of the key elements of our approach is the explicit modeling of context by web ontology language based on which the logic reasoning is performed. besides, an internal object-oriented architectural self-management mechanism is proposed. a prototype of mac is also given followed by a case study with quantitative evaluations.
reflective layer activation in contextl. expressing layer dependencies in context-oriented programming is cumbersome because until now no facility has been introduced to control the activation and deactivation of layers. this paper presents a novel reflective interface that provides such control without compromising efficiency. this allows expressing complex application-defined dependencies between layers where the activation or deactivation of a layer requires the activation or deactivation of another one. the activation or deactivation of specific layers can also be prohibited based on application-defined conditions.
generalizing recognition of an individual dialect in program analysis and transformation. we present a novel method for generalizing the recognition capability of a tool from one dialect of a language to other dialects. the framework defines a novel base-dialect-specific map layer for representing program geography as recognised/unrecognised program zones in terms of an annotated preprocessor token stream. error call stacks generated in the front-end syntax-analysis are also stored in the map for invoking programmable, error handling and repair transformations to obtain recognizable constructs from un-recognized ones. an iterative process is followed, wherein for each transformation, reversion-identifying edits are also stored in the map to provide a handle on (and preserved semantics of) the unchanged, original form. to advance unconstrained dialect variation from the recognised base dialect, the map's edit components and all transformations are defined on text form, for which a novel datatype minimizing transformation conflict is defined denotationally. the datatype, anchored text, gives primacy to locations in the initial sources, independently of the code located thereat. this results in greater commutativity of software transformations. a case study of the approach in generalizing a sequential dialect of c to upc (unified parallel c) is carried out.
integrating a certified memory management runtime with proof-carrying code. software systems today are built from collections of interacting components written in different languages at varying levels of abstraction from the machine hardware. the ability to integrate certified components from different levels of a software architecture is a necessary part of the process of developing a dependable and secure computing infrastructure. in this paper we present a prototype system in the context of proof-carrying code that allows for the integration of safety proofs derived from a high-level type system with a certified, low-level memory management runtime library.
improved structural modeling based on conserved domain clusters and structure-anchored alignments. in this paper, we presented a method to improve structural modeling based on conserved domain clusters and structure-anchored alignments. we first constructed a template library of structural clusters for all conserved sequence domains. then, for each cluster, we built the profile using the structure and sequence information. finally we use the profile and structural alignments as anchors to increase the alignment accuracy between a query and its templates. our preliminary results show that this method can be used for the partial prediction for a majority of known protein sequences with better qualities.
real-time java processor optimized for rtsj. due to the preeminent work of the real-time specification for java(rtsj), java is increasingly expected to become the leading programming language in real-time systems. to provide a java platform suitable for real-time applications, a real-time java processor can execute java bytecode directly is proposed in this paper. this processor provides efficient support in hardware for mechanisms specified in the rtsj and offers a simpler programming model through ameliorating the scoped memory of the rtsj. the most important characteristic of the processor is that its wcet(worst case execution time) of the bytecode execution is predictable. it is vital for the real-time systems.