waashk/dblp huggingface dataset:
semi-supervised single-label text categorization using centroid-based classifiers. in this paper we study the effect of using unlabeled data in conjunction with a small portion of labeled data on the accuracy of a centroid-based classifier used to perform single-label text categorization. we chose to use centroid-based methods because they are very fast when compared with other classification methods, but still present an accuracy close to that of the state-of-the-art methods. efficiency is particularly important for very large domains, like regular news feeds, or the web. we propose the combination of expectation-maximization with a centroid-based method to incorporate information about the unlabeled data during the training phase. we also propose an alternative to em, based on the incremental update of a centroid-based method with the unlabeled documents during the training phase. we show that these approaches can greatly improve accuracy relatively to a simple centroid-based method, in particular when there are very small amounts of labeled data available (as few as one single document per class). using one synthetic and three real-world datasets, we show that, if the initial model of the data is sufficiently precise, using unlabeled data improves performance. on the other hand, using unlabeled data degrades performance if the initial model is not precise enough.
incremental discretization, application to data with concept drift. in this paper we present a method for incremental discretization able to be adapted to gradual changes in the target concept. the proposed method is based on the partition incremental discretization (pid for short). the algorithm divides the discretization task in two layers. the first layer receives the sequence of input data and retains some statistics of the data using more intervals than required. the second layer computes the final discretization, based in the statistics stored by the first layer. the method is able to process streaming examples in a single scan, in constant time and space even for infinite sequences of examples. in dynamic environments the target concept can gradually change over time. past examples may not reflect the actual status of the problem. to accommodate concept drift we use an exponential decay that smoothly reduces the importance of older examples. experimental evaluation on a benchmark problem for drift environments, clearly illustrates the benefits of the weighting examples technique.
modeling business processes in web applications: an analysis framework. the addition of business processes to modern web applications entails new challenges to be faced when developing them, hence the need for suitable methodologies to be adopted in the design phase. in response to this need, most of the design methodologies for web application available in the literature include a proper solution. in this paper we propose a framework for analyzing and comparing web application design methodologies with regard to their support for modeling business processes. the analysis framework has proved to be useful for assessing the ability of each considered methodology to deal with the design of business processes in web applications. the framework also provides suggestions on how to possibly enhance a given methodology.
remotefs: accessing remote file systems for desktop grid computing. we propose a remote file system for use in desktop grid applications. the proposed system provides programs with the ability to query and update files on remote machines without requiring any changes to the program code. the system (a) generates a profile of the program file operations and (b) uses the profile to implement collective and pre-fetched i/o.
toward a first-order extension of prolog's unification using chr: a chr first-order constraint solver over finite or infinite trees. prolog, which stands for programming in logic, is the most widely used language in the logic programming paradigm. one of its main concepts is unification. it represents the mechanism of binding the contents of variables and can be seen as solving conjunctions of equations over finite or infinite trees. we present in this paper an idea of a first-order extension of prolog's unification by giving a general algorithm for solving any first-order constraint in the theory t of finite or infinite trees, extended by a relation which allows to distinguish between finite and infinite trees. the algorithm is given in the form of 16 rewriting rules which transform any first-order formula &phi; into an equivalent disjunction &phiv; of simple formulas in which the solutions of the free variables are expressed in a clear and explicit way. we end this paper describing a chr implementation of our algorithm. chr (constraint handling rules) has originally been developed for writing constraint solvers, but the constraints here go much beyond implicitly quantified conjunctions of atomic constraints and are considered as arbitrary first-order formulas built on the signature of t. we discuss how we implement nested local constraint stores and what programming patterns and language features we found useful in the chr implementation of our algorithm.
automatic web pages categorization with relieff and hidden naive bayes. a great challenge of web mining arises from the increasingly large web pages and the high dimensionality associated with natural language. since classifying web pages of an interesting class is often the first step of mining the web, web page categorization/classification is one of the essential techniques for web mining. one of the main challenges of web page classification is the high dimensional text vocabulary space. in this research, we propose a hidden naive bayes based method for web page classification. we also propose to use the relieff feature selection method for selecting relevant words to improve the classification performance. comparisons with traditional techniques are provided. results on benchmark dataset show that the proposed methods are promising for accurate web page classification.
extending business process management to determine efficient it investments. in many sectors, companies model and optimize their business processes in order to better manage the external value that comes from these processes. supporting the execution of corporate business processes with an optimal set of it investments is crucial to a company's success. however, existing business process management (bpm) approaches do not integrate methods for evaluating and selecting efficient it investments and traditional evaluation methods are often inadequate. this paper proposes an extension that aims at a more adequate valuation, allocation, and selection of it investments with respect to the requirements of the given corporate business processes. such an extension allows decision makers in process-oriented organizations to interactively determine and continually optimize it investments. at the same time, the extension improves the decision makers' awareness of the efficiency of their investments and, thus, reduces the gap between technology and business by further completing the traditional bpm methodology. this paper implements such an approach in a decision support system and illustrates its application by means of an example.
handling heterogeneity in rosettanet messages. we present a semantic b2b gateway based on the wsmx semantic service-oriented architecture to tackle heterogeneities in rosettanet messages. we develop a rich rosettanet ontology and use the axiomatised knowledge and rules to resolve data heterogeneities and to unify unit conversions. we use adaptive executable choreography definitions to easily integrate new sellers into existing rosettanet collaborations.
integration of it service management into enterprise architecture. enterprise architecture supports organizational engineering in many ways. service orientation is regarded as dominant operations model for service providers -- within and beyond it. as a consequence, it is important to integrate service management and service orientation into enterprise architecture. this paper proposes an enterprise architecture extension that achieves such an integration. it service management is defined according to itil. based on the integration of service management into enterprise architecture, the integration of service oriented architecture is discussed as a further extension. the research is based on the business engineering approach and the guidelines of method engineering.
design of a simple and effective object-to-relational mapping technique. currently, most object-oriented applications use relational databases to meet their needs for persistent storage. however, object-oriented and relational paradigms represent information in manners that are quite different from each other. this results in two different models for representing the same information, thus increasing the design and maintenance efforts. several attempts have been made to overcome this impedance mismatch but all of them have fallen short of providing satisfactory results from one aspect or the other. this paper outlines a simple and straightforward approach to effectively overcome this challenge. our methodology yields a data model that is mechanically derived from the object model without compromising the performance of the system. the physical schema and the basic object persistence and population operations are automatically generated, thus, resulting in a system that makes design and maintenance much easier tasks than before.
an efficient dynamic memory allocator for sensor operating systems. dynamic memory allocation mechanism is important aspect of operating system, because an efficient dynamic memory allocator improves the performance of operating systems. in wireless sensor networks, sensor nodes have miniature computing device, small memory space and very limited battery power. therefore, sensor operating systems should be able to operate efficiently in terms of energy consumption and resource management. and the role of dynamic memory allocator in sensor operating system is more important than one of general operating system. in this pager, we propose new dynamic memory allocation scheme that solves problems of existing dynamic memory allocators. we implement our scheme on nano-qplus which is a sensor operating system base on multi-threading. our experimental results show our scheme performs efficiently in both time and space compared with existing memory allocation mechanism.
a global marking scheme for tracing cyber attacks. tracing complex attacks is among the research topics that are currently under development. limiting tracing to network traffic has allowed the reconstruction of the attack paths of a few attacks, but appears to be insufficient to trace complex attacks. in this paper, we propose a new tracing scheme that extends marking to additional malicious activities related to system running processes and modification actions operated at the host level, making use of compromise independent disk based components. these components are involved in the marking and the tracing process. the behavior of the new scheme for marking and tracing is illustrated against a sample attack scenario that integrates several techniques in order to increase the complexity of the attack. our scheme plays an important role in investigation and provides evidences that help an investigator determining the attacker and the actions he performed.
three integration approaches for map and b-scp requirements engineering techniques. integration of requirements engineering techniques has been common and proven beneficial. map is a strategy-driven modelling technique that elicits requirements in terms of intentions and strategies. b-scp is an approach to address alignment between requirements and business strategy. to address the problem of strategic requirements evolution in b-scp, we have previously proposed the possibility of integrating map with b-scp. in this paper, we present three integration approaches for map and b-scp and evaluate their usefulness for two case studies: seven eleven japan (sej) and commsec australia. sej presents an enterprise problem domain, while commsec australia presents a simple application domain. we find that each integration approach has advantages and disadvantages. we also conclude that the usefulness of each integration approach varies depending on the complexity of application domain and the nature of modelled requirements.
checking software component behavior using behavior protocols and spin. using software components is a modern approach for building extensible and reliable applications. to ensure high dependability, a component application should undergo verification, e.g. model checking, to prove it has certain properties. the implementation of an application is usually too complex to be verified at a formal level; therefore, a model being an abstraction of the implementation is to be used. behavior protocols [11] are a platform for modeling of software component behavior. in this paper, we propose a method for translation behavior protocols to promela [7], which is consequently used as the input for the spin model checker [7]. having the promela code describing the component behavior, one can efficiently check for the behavior compatibility and ltl (linear temporal logic) properties of cooperating software components.
formal verification of security specifications with common criteria. this paper proposes a formalization and verification technique for security specifications, based on common criteria. generally, it is difficult to define reliable security properties that should be applied to validate an information system. therefore, we have applied security functional requirements that are defined in the iso/iec 15408 common criteria to the formal verification of security specifications. we formalized the security criteria of iso/iec 15408 and developed a process, using z notation, for verifying security specifications. we also demonstrate some examples of the verification instances using the theorem prover z/eves. in the verification process, one can verify strictly whether specifications satisfy the security criteria defined in iso/iec 15408.
energy management for interactive applications in mobile handheld systems. the usage of interactive applications increases in handheld systems. in this paper, we describe a system-level dynamic power management scheme that considers interaction between the cpu and the wnic, and interactive applications to reduce the energy consumption of handheld systems. previous research efforts considered the cpu and the wnic separately to reduce energy consumption. the proposed scheme reduces the energy consumption of handheld systems by using the information gathered from the wnic to control the cpu voltage and frequency when interactive applications are executed. experimental results show that on average the proposed scheme reduces energy consumption by 46% when compared to dvfs (dynamic voltage and frequency scaling) for the cpu and dpm (dynamic power management) for the wnic.
trust-based service provider selection in open environments. the problem of selecting correct counterparts to interact with is of particular relevance in open and dynamic environments. this problem increases when third parties may vary their behaviour at will. in this paper we examine the problem of service provider selection using trust and reputation techniques. most approaches to service provider selection are based on the client's proper experiences about particular services from particular providers. a problem arises when no previous experience is available. to solve this problem, previous approaches have proposed that clients obtain the required reputation information from their acquaintances. in contrast, our work advocates an experience-based approach for service provider selection, in which clients use trust and reputation mechanisms to infer expectations of future providers' behaviour from past experiences in similar situations. we present some experimental results that support our proposal.
combining cybernetics and conceptual modeling: the concept of variety in organizational engineering. organizational engineering addresses various aspects of changing organizations in order to create and keep the alignment between business and information technology (it). in this paper, we show how the combination of cybernetic theories with conceptual modeling contributes to the analysis and design of information systems and organizations. based on the discussion of a language-driven understanding of information systems as socio-technical systems, we show how conceptual models can significantly contribute to organizational engineering if used in combination with the concept of variety, an established theory from cybernetics. within an it controlling case, we show how our approach can be applied to the diagnosis of an it controlling and reporting system in the german subsidiary of a large european bank.
designing a trust chain for a thin client on a live linux cd. cd-boot linuxi is a live linux environment, which is easy to use because it is not installed in the hard disk, but simply boots directly from a cd. this helps protect the sensitive information because a clean environment can be prepared at boot time. to insure this environment protects sensitive information, we adapted the trusted computing technology to define a trustworthy environment.
reifying wildcards in java using the ego approach. providing runtime information about generic types---that is, reifying generics---is a challenging problem studied in several research papers in the last years. however, the quest for finding effective and efficient solutions specifically targeted to the java programming language is still open. in particular, the new mechanism of wildcards introduced in java 5.0 significantly complicates the overall semantics of generics: its reification aspects are currently unexplored and pose serious implementation issues. in this paper we analyse such issues and study how they have been supported in the context of the ego compiler. ego is an approach for efficiently supporting runtime generics at compile-time in java: synthetic code is automatically added to the source code by the compiler, so as to create generic runtime type information on a by-need basis, store it into object instances, and retrieve it when necessary in type-dependent operations. we show how the design of ego has been completely and successfully extended to represent wildcard types, and how we deal with subtle issues concerning subtyping, capture conversion and wildcards capture in method calls.
mining itemsets in the presence of missing values. missing values make up an important and unavoidable problem in data management and analysis. in the context of association rule and frequent itemset mining, however, this issue never received much attention. nevertheless, the well known measures of support and confidence are misleading when missing values occur in the data, and more suitable definitions typically don't have the crucial monotonicity property of support. in this paper, we overcome this problem and provide an efficient algorithm, xminer, for mining association rules and frequent itemsets in databases with missing values. xminer is empirically evaluated, showing a clear gain over a straightforward baseline-algorithm.
fighting pollution dissemination in peer-to-peer networks. recent studies reported a new form of malicious behavior in popular file-sharing peer-to-peer (p2p) systems, namely, content pollution, which reduces content availability, decreasing the confidence of users in such systems. this paper proposes scrubber, a new descentralized peer reputation system that imposes severe and quick punishment to content polluters but also promotes peer rehabilitation. we evaluate the efficiency of scrubber in reducing pollution dissemination via simulation, comparing it against the previously proposed credence object reputation system as well as a system without reputation. two pollution mechanisms, namely, decoy insertion and identifier corruption, are considered. our results show that, for various scenarios, scrubber is able to quickly reduce the fraction of daily downloads to polluted content to a small percentage. if compared to credence, scrubber has a much better convergence and competitive maximum efficiency, unless the fraction of peers that delete their polluted content in response to punishment (i.e., download request refusals) is very small (under 25%). in this case, credence achieves a slightly higher efficiency in the long run.
defining personalized therapies for handheld devices. this paper presents a framework that provides psychotherapists with means to tailor specific therapies for their patients. used artifacts can be easily adapted to the patient's problem, to his evolution rhythm, therapy stage or even to possible filling in situations. furthermore, the artifacts can be configured to proactively adapt to the patient's behavior, according to previously defined rules, extending the therapist's motivating role. the framework ranges from desktop computers, to mobile devices (e.g. pdas and tabletpcs) covering therapeutic tasks for both patient and therapist.
biased box sampling - a density-biased sampling for clustering. this paper presents the bbs - biased box sampling algorithm, a technique that combines dimensionality reduction with biased sampling, which aims at keeping the skewed clustering from the original data.
towards resource-certified software: a formal cost model for time and its application to an image-processing example. visual tracking requires sophisticated algorithms working in real-time, and often space-limited, settings. while the input streams may be regular in structure, the algorithms are not, and must often deal with probabilistic metrics. to ensure progress in algorithm design without incurring excessive development costs, we propose a high-level programming approach married with predictable and compositional performance metrics. this enables the combination of independently developed program components into coherent software architecture, with certified resource use guarantee. here, we present our approach and discuss its application to the development and resource analysis of a space bound mean shift algorithm for motion tracking, using the new embedded system-oriented language hume.
an additive-attack-proof watermarking mechanism for databases' copyrights protection using image. this paper discusses the feasibility of embedding a bit map image (bmp file) into the relational databases for protecting data's copyrights and the term of wdi (watermarking databases using image) is proposed. an error correction approach of bch (bose-chaudhuri-hocquenhem) coding is used for enhancing the robustness of the algorithms. and a trusted third party (ttp), which can trigger watermarking mobile agents to insert and detect watermark, is introduced to resist the additive attack and invertibility attack. further more, we also analyze the resilience of the algorithm theoretically based on the principles of statistics in detail. experiments showed that the approach proposed in this paper is robust to many kinds of attacks so that the copyrights can be effectively protected.