waashk/dblp huggingface dataset:
data stream management system for mavhome. mavhome project provides rich applications for addressing various issues associated with stream data processing. in this paper, we present our approach for building a data stream management system (dsms) for the above smart home project. we further summarize our primitive solutions for continuous query processing, quality of service(qos) management, and mapping a trigger mechanism to a stream processing system.
symmetry in event structures. a notion of symmetry for event structures is defined, which are based on permutation groups. given an event structure and a permutation group over it, we introduce the quotient model of the event structure and show that the quotient model is trace, bisimulation and pomset equivalent to the original event structure.
protein threading with residue-environment matching by artificial neural networks. protein threading programs align a probe amino acid sequence onto a library of representative folds of known protein structure to identify a structural homology. a scoring function is usually formulated in terms of the threading energy to evaluate protein sequence-structure fitness. the structure that yields the lowest total energy is considered the leading template of the probe protein. an alternative approach is to predict the probabilities of observing amino acid side-chains in structural environment without considering the energy of contacts. in this paper, a model named tes is proposed on building a new environment-specific protein sequence-structure mapping with artificial neural network. the decoy sets obtained from the web are used to test the proposed tes method on discrimination of native and decoy protein three-dimensional structure. the verified approach shows that the performance of the proposed method is comparable to those of knowledge-based potential energy function.
covatm: a transaction model for cooperative applications. it has been widely recognized that traditional transaction models with acid(atomicity, consistency, isolation and durability) properties generally are not applicable to cooperative applications. though many advanced transaction models have been proposed to address the problems, they are too database-centered or too rigid to be useful in real environments. this paper presents a new transaction model named covatm, which provides sophisticated but flexible control over cooperative process as well as support for error recovery and exception handling. the most distinguished feature of this model is that user intervention is explicitly introduced into transaction processing. this paper details the features and structural elements of this model. an example is also given to illustrate how it works in real world settings.
sanitizing using metadata in metaxquery. metadata plays an important role in describing and proscribing data in both traditional and xml applications. in this paper, we present an extension of the xml data model and xquery query language to certify the reachability of data and to sanitize data with the existence of metadata, especially proscriptive metadata. the data model extension is called metadom, and the query language is called metaxquery. this paper describes a certify function to check if the metadata in the data model is correctly embedded, in other words, whether all of the data nodes are reachable from the root. it also describes a sanitize function that automatically corrects the data model if it is invalid. the sanitize function can also be used to generate a view of the data from a specific metadata perspective.
efficient query routing for information retrieval in semantic overlays. a fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. this paper proposes a model in which semantically similar peers form a semantic overlay network and a query can be routed or forwarded to appropriate peers instead of broadcasting or random selection. we apply latent semantic indexing (lsi) in information retrieval to reveal semantic subspaces of feature spaces from documents stored on peers. after producing semantic vectors through lsi, we train a support vector machine (svm) to classify the peers into different categories based on the extracted vectors. peers with close categories are defined as semantic similarity and form a semantic overlay. experimental results show the model is efficient and performs better than other non-semantic retrieval models with respect to accuracy. in addition, our approach improves the recall rate nearly 100% while reducing message traffic dramatically compared with gnutella.
a new approach to the bdi agent-based modeling. intelligent agents have been regarded as a new notion to build complex software systems. in this paper, we propose an agent-based software development process based on belief-desire-intention (bdi) agent model as a new software development process. the belief-desire-intention (bdi) model has been used as a fundamental ingredient to the new agent-based modeling method. in our agent system proposed here, each agent is made flesh by assigning its own belief, desire and intention. here we have shown a seamless software development modeling technique consistently based on the bdi model. even though there are many valuable arguments to define agents beside the bdi model, we currently use the bdi model only to simplify the agent modeling because we try to develop a more realistic agent-based modeling technique. we will extend this work to support other key concepts in agent computing.here we propose a new approach comparing it with our previous approach to support the bdi agent-based modeling techniques. the previous approach finds intentions, desires and beliefs from two different kinds of use cases - external use cases and internal use cases - and supporting tools. the new approach finds in sequence desires, intentions and beliefs by using not only different kinds of use cases, sequence diagram, activity diagrams, and dataflow diagrams. to prove the usability of our software development process, we also provide a case study to clarify the description of our bdi agent software development process. this paper also introduces a brief structure of a case tool that we are currently developing to support the bdi agent software development process.
editorial: programming languages track. programming languages are programmers' most basic tools. with appropriate programming languages one can drastically reduce the cost of building new applications as well as maintaining existing ones. in the last decade programming languages have made a large shift from procedural and structured programming towards new programming paradigms such as logic, functional and object-oriented programming. the main driving force was and will continue being to better express programmer's ideas. therefore, research in programming languages is an endless activity and the core of computer science. new language features, new programming paradigms, better compile-time and run-time mechanisms can be foreseen in the future. the pl track aims at providing researchers and practitioners with opportunities to present their ideas and experience in designing new programming concepts and implementing programming languages.
editorial message: programming languages track. programming languages are notations for describing our thoughts on computers. as the ways of thinking the problems and solutions have evolved in many different ways, many different programming languages have been invented to describe our solutions based on the different approaches.
a dialogue on responsibility, moral agency, and it systems. the dialogue that follows was written to express some of our ideas and remaining questions about it systems, moral agency, and responsibility. we seem to have made some progress on some these issues, but we haven't come to anything close to agreement on several important points. while the issues are becoming more clearly drawn, what we have discovered so far is closer to a web of connecting ideas, than to formal claims or final conclusions.
hierarchical presentation of expansion terms. different presentations of candidate expansion terms have not been fully explored in interactive query expansion (iqe). most existing systems that offer an iqe facility use a list form of presentation. this paper examines an hierarchical presentation of the expansion terms which are automatically generated from a set of retrieved documents, organised in a general to specific manner, and visualised by cascade menus. to evaluate the effectiveness of the presentation, a user test was carried out to compare the hierarchical form with the conventional list form. this shows that users of the hierarchy can complete the expansion task in less time and with fewer terms over those using the lists. relations between initial query terms and selected expansion terms were also investigated.
language support for incremental integration of independently developed components in java. the aim of component-based software development is to assembly applications from existing components, writing as little extra code as possible. for programmers, assembly of applications from existing components should increase reuse, thus allowing them to concentrate on value-added tasks and to produce high-quality software within a shorter time. for users, component-based software development promises tailor made functionality from the adaptaion of ready-made components. however, this ideal scenario has not yet become reality: today, many applications are still developed from scratch, and there are still relatively few ready-made components that can be easily reused in new applications. why is it so? we believe that part of the answer is that current object-oriented programming languages are missing support for non-invasive dynamic adaptation that works at the level of multiple objects simultaneously. such support would allow unanticipated, incremental modifications of a system's components at runtime. in this paper we propose lasagne/j an extension of the java programming language that helps programmers to overcome many of the integration problems that they face when assembling new applications from components developed by independent component vendors.
on the architectural alignment of atl and qvt. transforming models is a critical activity in model driven engineering (mde). with the expected adoption of the omg qvt standard for model transformation language it is anticipated that the experience in applying model transformations in various cases will increase. however, the qvt standard is just one possible approach to solving model transformation problems. in parallel with the qvt activity many research groups and companies have been working on their own model transformation approaches and languages. it is important for software developers to be able to compare and select the most suitable languages and tools for a particular problem. this paper compares the proposed qvt language and the atlas transformation language (atl) as a step in the direction of gathering knowledge about the existing model transformation approaches. the focus is on the major language components (sublanguages and their features, execution tools, etc.) and how they are related. both languages expose a layered architecture for organizing their components. the paper analyzes the layers and compares them according to various categories. furthermore, motivations for interoperability between the languages and the related tools are given. possible solutions for interoperability are identified and discussed.
exploiting fast ethernet performance in multiplatform cluster environment. as the communication subsystem largely determines the overall performance and the characteristics of cluster systems, it must face diverging demands such as bandwidth, latency, quality of service and cost. in this paper we investigate the performance and improvement possibilities of a portable tcp/ip based communication subsystem that aims to integrate heterogeneous nodes. the cluster is built up from standard pcs connected with low-cost network, where nodes may have different processor speed, memory size and may even run different operating systems. we present and compare application level end-to-end latencies measured under different conditions varying the number of simultaneous connections, processing threads and the types of operating systems. our experiments show that message latencies are overwhelmingly dominated by software overheads, which can be hidden or eliminated by different methods, thus pc clusters can take good advantage of the bandwidth of a fast ethernet connection even with smaller message sizes. finally, based on the results, we draw the attention to a domain of inaccuracy of the standard communication models in pc cluster environment, and we suggest a new formula to describe the latency of concurrent message channels over the same medium.
editorial message: special track on applications of evolutionary computation. the mechanisms that drive biological evolution are reproduction with variation, reproductive success proportional to fitness, and repetition. in any system where these mechanisms are active, populations of objects-biological or artificial-will evolve. among such systems are evolutionary algorithms, which apply techniques inspired by biological evolution to search for good solutions to computationally difficult problems.
editorial message: track on applications of evolutionary computation. many computational techniques are inspired by biological models; for example, neural networks by nervous systems and expert systems by the if-then rules of expert reasoning. among these biologically-inspired techniques is evolutionary computation, whose motivating ideas are the mechanisms that drive evolution: reproduction with variation, reproductive success proportional to fitness, and repetition. evolutionary algorithms have been applied to a wide variety of problems of search and optimization.
two hybrid evolutionary algorithms for the rectilinear steiner arborescence problem. given a collection of points in the first quadrant, a rectilinear steiner arborescence is a tree made up of horizontal and vertical line segments on the points and the origin in which every path from the origin leads only up and to the right. the minimum rectilinear steiner arborescence problem seeks such a tree of minimum total length.a greedy heuristic due to rao et al. [13] builds short arborescences and can be implemented to require time that is o(n log n). two evolutionary encodings of rectilinear steiner arborescences represent them as permutations of points and as strings of perturbations of point locations. a decoder in the style of prim's algorithm identifies the arborescence that a permutation represents; the heuristic of rao et al. identifies the arborescence corresponding to a string of perturbations.in tests on twenty instances of the problem of 50 to 250 points, a genetic algorithm using the permutation coding is unable to compete with the greedy heuristic, but a ga using the perturbation coding almost always improves on the heuristic's results, though in general the improvement is small.
initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. evolutionary algorithms (eas) that search spaces of spanning trees can encode candidate trees as sets of edges. in this case, edge-sets for an ea's initial population should represent spanning trees chosen with uniform probabilities on the graph that underlies the target problem instance. however, the generation of random spanning trees is not as simple as it might appear. mechanisms based on prim's and kruskal's minimum spanning tree algorithms are not uniform, and uniform mechanisms are slow, not guaranteed to terminate, or require that the underlying graph be complete.however, a non-uniform initial population of spanning trees need not harm an ea's performance. trials of a crossover-only ea for the one-max-tree problem, using prim-based, kruskal-based, and uniform initialization, indicate that the distribution of edges in the initial population is far more important than the distribution of trees. a skewed distribution of edges in its initial population damages the ea's performance, but this is remedied by a reasonable amount of mutation.
a uml statecharts semantics with message-passing. we give a formal semantics for one of the main uml diagram types for dynamical system behavior: statechart diagrams. this is the first semantics which explicitly models message-passing between different diagrams. it therefore lays a first foundation for executable uml modeling, allowing whole systems of uml specifications (rather than single diagrams) to be simulated.
using umlsec and goal trees for secure systems development. today many software systems need to take into account security considerations. while software engineering has been quite successful in ensuring that systems satisfy non-functional requirements such as dependability, less work has been done wrt. security requirements.in this work we present a software engineering method aiming to facilitate secure systems development, which is based on an extension of uml called umlsec.
avoiding data conversions in embedded media processors. complex application-specific media instructions and kernels are emulated with simple to implement extended subword instructions. we show that assuming extended register file entries to accommodate intermediate results and by implementing a few simple instructions, packing/unpacking, saturation, and frequently used complex instructions can be practically eliminated. it is shown that in most emulations there is a potential performance improvement, making the proposed scheme suitable for embedded processors with a limited hardware budget.
describing dynamic software architectures using an extended uml model. in this paper, we propose a new uml2.0 profile to describe the change of software architectures. the profile introduces a set of stereotypes for modeling the structural and the dynamic aspect as well as architectural constraints. we adapt the component diagrams metamodel on specific purposes by extending existing metaclasses. the adaptations are defined using stereotypes which are grouped in a profile. the profile offers to the architects an intuitive and complete way to specify the software architecture based on visual notations.
a particle swarm model for swarm-based networked sensor systems. swarm behavior as demonstrated by flocks of birds, schools of fish, and swarms of insects provide a useful method for implementing a distributed network of mobile sensor platforms. such mobile sensor swarm systems are useful for various search or surveillance activities. swarm behavior ensures safe separation between swarm members while enforcing a level of cohesion. these two properties, when considered in the context of sensors and wireless communications, provide for low redundancy coverage and a robust and reliable communications system. this paper examines particle swarm behavior through simulation with respect to such a sensor network. analysis of swarm behavior for various parameter settings indicate a classification methodology. this provides a foundation for a proposed taxonomy.
a framework for implicit and explicit service activation based on service level specification. internet protocol-based applications are the prevailing trend of the telecommunications market, but the path towards the "ip over everything" target is not unhampered. the main shortcoming of the ip protocol is its incapability of providing guaranteed quality of service (qos), although significant effort is spent within different standardization bodies and organizations. we propose architecture for the implicit and explicit service activation of internet services with guaranteed qos, based on existing service level specification (sls). the supported level of qos is according to the customer's demands and the network supportability defined within the terms of a signed service level agreement (sla). the main idea is that the service provider can perform service management effectively in an aggregated manner while the customer is provided with an uncomplicated interface to specify his service request.
delivering attribute certificates over gprs. attribute certificates (acs) have been developed and standardized by the ansi x9 committee as an alternative and better approach, to x.509 public key certificates, for carrying authorization information. attribute authorities (aa) bind the characteristics of an entity (called attributes) to that entity by signing the appropriate ac. therefore, acs can be used for controlling access to system resources and employing role-based authorization and access controls policies accordingly. although acs are widely used and standardized, to the best of our knowledge, no mobile infrastructure or service currently utilizes them. in this paper, we first examine how basic public key infrastructure (pki) can be incorporated into mobile networks and especially the universal mobile telecommunications system (umts). as a case study, we then experiment with acs in the gprs network, using a prototype implementation. in particular, we investigate and measure the performance in terms of service and transfer times when acs are introduced in the mobile environment. our measurements show that acs technology not only is feasible to implement in present and future mobile networks, but at the same time can deliver flexible and relatively fast services to the subscribers, without compromising security.
editorial message: special track on ubiquitous computing. ubiquitous technologies, infrastructures, applications and services that operate across physical environments (e.g. neighbourhood, home, car etc) will soon be spanning all the different spheres of everyday life. ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday activities. the ubiquitous computing world is largely defined by applications, which present an altogether new set of requirements. in order to assess the impact of ubiquitous computing and discover caveats as early in the adoption process as possible, we need to study and analyze working prototypes applied in real-life settings and scenarios. the special track on ubiquitous computing applications, now in its third year, provides a forum for the discussion of all types of ubiquitous computing applications and related specialized infrastructures built for the deployment of targeted applications. individual papers place applications within their use context and introduce novel and appropriate interaction paradigms while at the same time addressing related technical and business aspects and consequently identify novel opportunities or constraints.
selective method combination in mixin-based composition. a mixin is a reusable module that provides uniform extensions and modifications to classes. it is an abstract subclass that is composable with a variety of superclasses. in mixin-based composition, however, the problem of accidental overriding arises. a method declared in a mixin may accidentally overrides its superclasses' method. to tackle this problem, we propose a new approach of method lookup that allows selective method combination; that is, when we have multiple methods with the same name and the same formal parameter types in a composition, we can select which method to execute, and which method is called when there exists a method call to super. this proposal is an extension of hygienic mixins with stronger expressive power. this proposal is implemented in mcjava, an extension of java with mixintypes. its compilation is achieved by source code translation to java thus making it runnable on a standard java virtual machine.