waashk/dblp huggingface dataset:
decentralized web service orchestration: a reflective approach. web service orchestration is widely spread for the creation of composite web services using standard specifications such as bpel4ws. the myriad of specifications and aspects that should be considered in orchestrated web services are resulting in increasing complexity. this complexity leads to software infrastructures difficult to maintain with interwoven code involving different aspects such as security, fault tolerance, distribution, etc. in this paper, we present zen-flow a reflective bpel engine that enables to separate the implementation of different aspects among them and from the implementation of the regular orchestration functionality of the bpel engine. we illustrate its capabilities and performance exercising the reflective interface through a decentralized orchestration use case.
engineering intuitive and self-explanatory smart products. one of the main challenges in ubiquitous computing is making users interact with computing appliances in an easy and natural manner. in this paper we discuss how to turn ordinary devices into smart products that are more intuitive to use and are self-explanatory. we present a general architecture and a distributed runtime environment for building such smart products and discuss a number of user interaction issues. as an example, we describe our smart coffee machine and its validation through systematic user testing.
bwt-based efficient shape matching. effective shape-based image retrieval requires an appropriate representation of object shape contours. such a representation should be invariant under certain transformations, such as those due to rotation, scaling, partial occlusion, noise in the image, or changes in the viewing geometry. given a shape boundary, we decompose it into primitive shape segments that capture the saliency of object parts, and perform retrieval based on the primitives. motivated by the sorted contexts of the burrows-wheeler transform, we present an algorithm for efficient shape matching, suitable for large-scale shape databases, when the shape boundaries are represented as a sequence of shape primitives. given a query shape, the algorithm can locate all the potential areas in the database where a match could occur in time that is logarithmic with respect to the database size. the potential matches are then verified in time that is linear with respect to the number of potential matches. performance of the proposed algorithm is evaluated using both synthetic and real shape databases.
modular multiple dispatch with multiple inheritance. overloaded functions and methods with multiple dispatch are useful for extending the functionality of existing classes in an object-oriented language. however, such functions introduce the possibility of ambiguous calls that cannot be resolved at run time, and modular static checking that such ambiguity does not exist has proved elusive in the presence of multiple implementation inheritance. we present a core language for defining overloaded functions and methods that supports multiple dispatch and multiple inheritance, together with a set of restrictions on these definitions that can be statically and modularly checked. we have proved that these restrictions guarantee that no undefined nor ambiguous calls occur at run time, while still permitting various kinds of overloading.
self-healing for autonomic pervasive computing. self-healing is one of the main challenges to growing autonomic pervasive computing. fault detection and recovery are the main steps of self-healing. due to the characteristics of pervasive computing the self-healing becomes difficult. in this paper, the challenges of self-healing have been addressed and an approach to develop a self-healing service for autonomic pervasive computing is presented. the self-healing service has been developed and integrated into the middleware named marks+ (middleware adaptability for resource discovery, knowledge usability, and self-healing). the self-healing approach is being evaluated on a test bed of pdas. an application is being developed by using the proposed service.
semantic distance of concepts within a unified framework in the biomedical domain. this paper presents a cross-ontology approach, as an extension of the cluster-based approach, to measure semantic distance between concepts within single ontology or between concepts dispersed in multiple ontologies in a unified framework in the biomedical domain. the experimental results (with ~0.81 correlation with human scores) confirmed that the proposed approach is effective and has great potential in measuring semantic distance using multiple ontologies in a unified framework.
sipre: a partial database replication protocol with si replicas. database replication has been researched as a solution to overcome the problems of performance and availability of distributed systems. full database replication, based on group communication systems, is an attempt to enhance performance that works well for a reduced number of sites. if application locality is taken into consideration, partial replication, i.e. not all sites store the full database, also enhances scalability. on the other hand, it is needed to keep all copies consistent. if each dbms provides si, the execution of transactions has to be coordinated so as to obtain generalized-si (gsi). in this paper, a partial replication protocol providing gsi is introduced that gives a consistent view of the database, providing an adaptive replication technique and supporting the failure and recovery of replicas.
a hybrid web recommender system based on q-learning. different efforts have been made to address the problem of information overload on the internet. recommender systems aim at directing users through this information space, toward the resources that best meet their needs and interests. web content recommendation has been an active application area for information filtering, web mining and machine learning research. recent studies show that combining the conceptual and usage information can improve the quality of web recommendations. in this paper we exploit this idea to enhance a reinforcement learning framework, primarily devised for web recommendations based on web usage data. a hybrid web recommendation method is proposed by making use of the conceptual relationships among web resources to derive a novel model of the problem, enriched with semantic knowledge about the usage behavior. with our hybrid model for the web page recommendation problem we show the apt and flexibility of the reinforcement learning framework in the web recommendation domain, and demonstrate how it can be extended in order to incorporate various sources of information. we evaluate our method under different settings and show how this method can improve the overall quality of web recommendations.
neural network based systems for computer-aided musical composition: supervised x unsupervised learning. this ongoing project describes neural network applications for helping musical composition using as inspiration the natural landscape contours. we propose supervised and unsupervised learning approaches, by using back-propagation-through-time (bptt) and self organizing maps (som) neural networks. in the supervised learning, the network learns certain aspects of musical structure by means of measure examples taken from melodies of the training set and uses these measures learned to compose new melodies using as input the extracted data of the landscapes contour. in the unsupervised learning, the network also uses measure examples as input during training and the extracted data of the landscapes contour in the composition stage. the obtained results show the viability of both approaches.
universal concurrent constraint programing: symbolic semantics and applications to security. we introduce the universal timed concurrent constraint programming (utcc) process calculus; a generalisation of timed concurrent constraint programming. the utcc calculus allows for the specification of mobile behaviours in the sense of milner's &pi;-calculus: generation and communication of private channels or links. we first endow utcc with an operational semantics and then with a symbolic semantics to deal with problematic operational aspects involving infinitely many substitutions and divergent internal computations. the novelty of the symbolic semantics is to use temporal constraints to represent finitely infinitely-many substitutions. we also show that utcc has a strong connection with pnueli's temporal logic. this connection can be used to prove reachability properties of utcc processes. as a compelling example, we use utcc to exhibit the secrecy flaw of the needham-schroeder security protocol.
a self-balancing striping scheme for nand-flash storage systems. to use multiple memory banks in parallel is a nature approach to boost the performance of flash-memory storage systems. however, realistic data-access localities unevenly load each memory bank and thus the benefits of parallelism is severely limited. in this work, we propose to encode popular data with redundancy by means of erasure codes. load balancing is thus achieved by accessing only lightly loaded banks, because to retrieve a subset of data blocks and code blocks sufficiently reconstructs the requested data. the technical issues pertain to redundancy allocation, redundancy placement, and request scheduling. by experiments, we found that, by offering 10% extra redundant space, the read response time is largely improved by 30%.
k-means discriminant maps for data visualization and classification. over the years, many dimensionality reduction algorithms have been proposed for learning the structure of high dimensional data by linearly or non-linearly transforming it into a low-dimensional space. some techniques can keep the local structure of data, while the others try to preserve the global structure. in this paper, we propose a linear dimensionality reduction technique that characterizes the local and global properties of data by firstly applying k-means algorithm on original data, and then finding the projection by simultaneously globally maximizing the between-cluster scatter matrix and locally minimizing the within-cluster scatter matrix, which actually keeps both local and global structure of data. low complexity and structure preserving are two main advantages of the proposed technique. the experiments on both artificial and real data sets show the effectiveness and novelty of proposed algorithm in visualization and classification tasks.
organizational modeling with a semantic wiki. this paper presents a basic set of modeling primitives with the purpose of enabling the construction of semantically rich and coherently integrated organizational models, in the context of enterprise engineering and architecture. this set, called "semantic bootstrap for organizational modeling", is being operationalized through the use of a semantic wiki. this tool's paradigm has a number of key advantages that seem to allow it to function as a master blue print or aggregation tool for the several different blue prints (views) that one can elicit from an organization.
revisiting exact combinational circuit synthesis. the paper revisits exact combinational circuit synthesis with logic programming tools. our focus is finding a minimal cost circuit that matches a specification - a notoriously hard nondeterministic search problem. after an exhaustive expressiveness comparison of various minimal libraries, two asymmetrical operations, logical implication "&rarr;" and strict boolean inequality "<" turn out to consistently outperform their more popular symmetrical couterparts nand and nor, while having comparably small transistor count implementations. the code of the synthetizer and various libraries is available at http://logic.csci.unt.edu/tarau/research/2007/isyn.zip.
middleware of taiwan unigrid. taiwan unigrid (taiwan <u>uni</u>versity <u>grid</u>) is a grid computing platform, which is founded by a community of educational and research organizations interested in grid computing technologies in taiwan. in this paper, we present the design and development of a middleware for taiwan unigrid. taiwan unigrid middleware consists of three primary modules: 1) unigrid portal, 2) computing service, and 3) data service. we explain the major design issues that we suffered from the development of these three modules and propose the corresponding approaches to them. the detailed system architecture, software components and features are elaborated. finally, an example of a workflow consisting of mpi parallel jobs demonstrates that users can utilize grid resources with ease via our middleware platform.
lambda functions for c++0x. a "functional" style of programming has become common in c++, following the introduction of the "standard template library" (stl) into c++'s standard library. c++ is, however, notably lacking in its support for this style and thus cannot take full advantage of its own standard libraries. c++'s mechanisms for defining functions or objects to pass to stl algorithms are overly verbose. the effective use of modern c++ libraries calls for lambda functions in the language. this paper describes a design and implementation of built-in lambda functions for c++. c++'s compilation model, where activation records are maintained in a stack, and the lack of automatic object lifetime management, make safe lambda functions and closures challenging: if a closure outlives its scope of definition, references stored in a closure dangle. our design is careful to balance between conciseness of syntax and explicit annotations to guarantee safety. lambda functions can be declared without annotating their parameter types. c++0x, the forthcoming revision of standard c++, supports constrained templates and modular type checking. we describe how to infer parameter types of lambda functions from the constraints of generic functions in order to support modular type checking in the presence of lambda functions. our design is currently under consideration for adoption to c++0x.
exploiting semantic information on a message exchanging middleware. in this paper we present our efforts on including semantic information on a middleware for message exchanging. the middleware configuration module makes use of a rule-based reasoner that infers the best module to be used on a given configuration of network and application. we have learned that a semantic-enabled message exchanging middleware is useful to decouple not only the application from the underlying communication facilities, but also the middleware itself from the task of selecting the appropriate module for a given configuration of application and underlying network.
a strategy for memory traffic management of bitmap fonts for text visualization in mobile devices. document viewer and browser applications have gained attention in the mobile scenario due to the improvement on accessibility and portability of different kinds of information. however, mobile devices are still limited in relation to memory size, processing capacity and battery. due to these limitations, software engineers that develop mobile applications must find ways to adequate them to the available. in this paper, we describe a strategy to safely manage memory traffic for mobile applications that intensively use bitmap font files, such as a document viewer.
secure deletion for nand flash file system. in most file systems, if a file is deleted, only the metadata of the file is deleted or modified and the file's data is still stored on the physical media. some users require that deleted files no longer be accessible. this requirement is more important in embedded systems that employ flash memory as a storage medium. in this paper, we have designed a nand flash file system that has a secure deletion functionality. we modified yaffs to support secure deletion. our method uses encryption to delete files and forces all keys of a specific file to be stored in the same block. therefore, only one erase operation is required to securely delete a file. the proposed method securely deletes not only keys but also all of the metadata of that file. our simulation results show that the number of block erases due to file creation and file modification is very low and the amortized number of block erases is lower than the simple encryption method. even though we applied our method only to the yaffs, our method can be easily applied to other nand flash file systems.
towards a complete scm ontology: the case of ontologising rosettanet. this paper presents a methodology to derive a supply chain management ontology based on the rosettanet specification framework. a prototype to mechanically derive a core ontology spanning all new partner interface processes in the rosettanet framework is developed and its algorithms to reconcile the ontology structure and to generate a proper subsumption hierarchy are presented. we further present how we designed and referenced outer layer ontologies we analysed to be required to resolve the remaining disparities in the core ontology. the resulting ontology framework enables to more easily deal with different message structures in dynamic business-to-business collaborations and thus ensures a better interoperability for the partners involved.
modular java web applications. as java ee applications increase in size and complexity the constraints imposed by the existing component model restrict their utility. in this paper, we describe a solution to the problem related to building modular and evolvable server-side applications in java. we use eclipse's osgi runtime as a basis for solving the problem and describe its integration in a java ee application server environment.
empirical evaluation of a new structure for adaboost. we propose a mixed structure to form cascades for adaboost classifiers, where parallel strong classifiers are trained for each layer. the structure allows for rapid training and guarantees high hit rates without changing the original threshold. we implemented and tested the approach for two datasets from uci [1], and compared results of binary classifiers using three different structures: standard adaboost, a cascade classifier with threshold adjustments, and the proposed structure.
supporting self-organization for hybrid grid resource scheduling. increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. in such grids, where resource volatility and dynamism is common, self-organization is a key technique for autonomous grid nodes to follow basic rules to minimize human participation, and administrative bottlenecks. this paper presents experimental results with a framework for distributed grid resource scheduling. in particular, we study information dissemination, which distributes information about dynamic grid resource states to remote schedulers. the framework helps each autonomous grid node self-organize by (1) self-configuring its operational parameters based on dynamic grid characteristics, and (2) self-adjusting its dissemination behavior by taking feedback from the system. the framework also helps distributed grid schedulers to find the tradeoff between two important performance parameters: dissemination overhead, and query satisfaction rates. we show by simulation that autonomous grid nodes that self-organize into small groups, and compare their local state to the states of other peer nodes, can perform comparable to both (1) similar dissemination protocols that are statically configured for each specific case, and (2) a theoretical central metascheduler that operates on complete knowledge of available resource and offered load states.
hermes: a semantic web-based news decision support system. the emergence of the web has made more and more news items available, however only a small subset of these news items are relevant in a decision making process. therefore decision makers need an information system that is capable of extracting a set of relevant news items automatically. this paper proposes a framework that provides decision makers with the ability to extract a set of news items related to specific concepts of interest. this is accomplished by creating a knowledge base and developing a system that classifies news with respect to the knowledge base.
bolos: blast & ontology linked-homologue stars. the growing number of protein sequences in databases has lead to, among other issues, an increase in redundancy, since many of the new sequences are similar to others already in the databases. while a comprehensive view of the protein space is essential, redundancy hampers large scale searches (such as blast) or studies (comparative genomics, functional genomics). one of the solutions to eliminate redundancy in the protein space is through clustering methods, which group redundant proteins into single entities (clusters). in this work we present bolos, a web tool that combines a clustered protein space with molecular function go term annotations, directed for functional genomics. it allows searches over the cluster space with a raw sequence, a swiss-prot protein or a molecular function go term, and provides three go-based parameters which allow the assessment of cluster quality and biological validity. the user can also chose one of the twelve different significance level cluster spaces available. for each cluster, bolos provides the essential information (name and accession number) about proteins and go terms it contains, as well as relevant statistics, while linking to external databases to allow the users to access further information. bolos is available at: http://xldb.di.fc.ul.pt/biotools/bolos/
configuring features with stakeholder goals. goal models are effective in capturing stakeholder needs at the time when features of the system-to-be have not yet been conceptualized. relating goals to solution-oriented features gives rise to a requirement traceability problem. in this paper, we present a new model-driven extension to an early requirements engineering tool (openome) that generates an initial feature model of the system-to-be from stakeholder goals. enabled by such generative mapping, configuration constraints among variability features can be obtained by reasoning about stakeholder goals.
type-based information flow analysis for bytecode languages with variable object field policies. static, type-based information flow analysis techniques targeted at java and jvm-like code typically assume a global security policy on object fields: all fields are assigned a fixed security level. in essence they are treated as standard variables. however different objects may be created under varying security contexts, particularly for widely used classes such as wrapper or collection classes. this entails an important loss in precision of the analysis. we present a flow-sensitive type system for statically detecting illegal flows of information in a jvm-like language that allows the level of a field to vary at different object creation points. also, we prove a noninterference result for this language.
a wireless hybrid contention/tdma-based mac for real-time mobile application. wireless communication has been successfully used in a variety of mobile applications, including those with real-time requirements. in such systems, timing guarantees are normally obtained by using a tdma-based medium access control (mac) protocol, relying in a coordinator node in charge of time-slots allocation. however, certain applications cannot make use of such coordinator because it simply does not exist, normally due to restrictions in the operation environment. to solve this problem we present in this paper a mac protocol that operates without a central coordinator, with minimum global information, and with no previous assignments of roles to nodes nor resource reservations. our proposed hybrid contention/tdma-based (hct) mac is specially designed to work with ad-hoc wireless networks organized in clusters, providing timely bounded communications both inside and outside the clusters. this paper presents a detailed description of the resource reservation procedure of hct, including an analytical analysis of its expected performance.