waashk/dblp huggingface dataset:
a cost-oriented methodology for the design of web based it architectures. this paper proposes a design methodology of web-based it architectures tying organizational requirements to technical choices and costs. information system design and optimum sizing is the result of a reconciliation of several conflicting requirements, including technical performance and costs. web-based it architectures involve a number of design choices with significant cost implications: the adoption of thin clients executing web applications remotely, the choice of the number of architectural tiers over the web, the allocation of applications on physical machines and the total number of servers involved. the main goal of this paper is the identification of a sequence of design steps, from requirements analysis to physical implementation, that allows designers to estimate the cost implications of architectural choices and, by evaluating multiple design alternatives, determine the minimum-cost architectural solution. preliminary results from the empirical verification of the methodology indicate that for web-based architectures cost reductions can be significant and would support the practical use of a cost-oriented approach as a complement to traditional performance evaluations.
a cost-oriented approach for infrastructural design. the selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of freedom. decisions must be made on how to distribute the overall computing load onto multiple computers, where to locate computers and how to take advantage of legacy components. the corresponding optimization problem not only embeds the structure of np-hard problems, but also represents a challenge with a well-structured heuristic approach. a scientific approach has been rarely applied to cost minimization and a rigorous methodological support to cost issues of infrastructural design is still lacking. the methodological contribution of this paper is the representation of complex infrastructural design issues as a single cost-minimization problem. the problem is decomposed in four interwined cost-minimization sub-prolems; optimization is accomplished by sequentially solving these sub-problems with a heuristic approach and tuning their solution with a final tabusearch step. results indicate that decomposition significantly reduces optimization time and solutions are also closer to the global optimum if results are compared to those identified without prior decomposition. cost reductions are also significant when practicioners' solutions, obtained by applying simplified design rules from the professional literature, are considered.
towards a scalable broadcast in wormhole-switched mesh networks. broadcast algorithms for wormhole---switched meshes have been widely reported in the literature. however, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. as a consequence, many parallel applications cannot be efficiently supported using existing algorithms. motivated by these observations, this paper presents a new broadcast algorithm based on our previously proposed coded path routing (or cpr for short) [1]. the main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. furthermore, its performance is insensitive to the network size, i.e., only two message-passing steps are required to implement a broadcast operation irrespective of the network size. results from a comparative analysis reveal that the new algorithm exhibits superior performance characteristics over those of the well-known recursive doubling, extending dominating node and network partitioning algorithms.
adaptive dissemination of dynamic information services in an extended data broadcast environment. considering that most information broadcast services generate data dynamically in practice, we devise in this paper an extended data broadcast mechanism which supports not only the original data broadcast scenario but also the dissemination of dynamic inforamtion services. furthermore, we design an on-line loan-based slot allocation and feedback technique to tolerate the dynamic changes of broadcast traffic and accordingly perform the adaptation of service classification, bandwidth allocation and broadcast schedule so as to enhance the performance. our experimental studies show that the extended data broadcast mechanism associated with the loan-based feedback technique is able to achieve a substantial saving in message traffic for dynamic information dissemination in wireless networks.
1-2pc: the one-two phase atomic commit protocol. this paper proposes a one-phase, two-phase commit (1-2pc) protocol that can be used to atomically commit internet transactions distributed across sites in a wide area network. the 1-2pc protocol is characterized by its ability to dynamically select between one-phase and two-phase atomic commit protocols depending on the behavior of transactions and the system requirements. thus, it offers the performance advantages of the one-phase atomic commit protocol whenever possible, while still providing the wide applicability of the two-phase commit protocol. this is achieved in spite of the incompatibilities between one-phase and two-phase commit protocols that lead to the general practice of having to adopt a single atomic commit protocol in any distributed database system.
a data mining approach for database intrusion detection. in this paper we proposed a data mining approach for detecting malicious transactions in a database system. our approach concentrates on mining data dependencies among data items in the database. a data dependency miner is designed for mining data correlations from the database log. the transactions not compliant to the data dependencies mined are identified as malicious transactions. the experiment illustrates that the proposed method works effectively for detecting malicious transactions provided certain data dependencies exist in the database.
reconciling diagrams after executing model transformations. in this paper we discuss how to create and update diagrams after the execution of a model transformation. this is achieved by creating an independent diagram reconciliation tool component that is based on a mapping language from the abstract syntax to the concrete syntax of a modeling language. this approach allows us to decouple model transformation from diagram handling in model transformation languages and tools.
applying model checking to bpel4ws business collaborations. web services are a very appropriate communication mechanism to perform distributed business processes among several organisations. these processes should be reliable, because a failure in them can cause high economic losses. in this work we propose a framework for the verification of business processes, called verbus. its aim is to help the designer to find errors in specifications at design time, thus increasing their reliability. contrary to verification frameworks previously proposed for business processes, verbus is a modular an extensible framework, in the sense that it is not tied to specific process definition languages or verification tools. this is achieved with the definition of an intermediate formalism that disconnects definition languages from verification tools. in this paper we present verbus, and its prototype, that integrates the bpel4ws definition language and the spin and smv verification tools.
solving the error correcting code problem with parallel hybrid heuristics. some telecommunication systems can not afford the cost of repeating a corrupted message. instead, the message should be somewhat "corrected" by the receiver. in these cases an error correcting code is suitable. the problem of finding an error correcting code of n bits and m codewords that corrects a given maximum number of errors is np-hard. for this reason the problem has been solved in the literature with heuristic techniques such as simulated annealing and genetic algorithms. in this paper we present a new local search algorithm for the problem: the repulsion algorithm. we further use a hybrid between parallel genetic algorithm and this new algorithm to solve the problem, and we compare it against a pure parallel genetic algorithm. the results show that an important improvement is achieved with the inclusion of the repulsion algorithm and the parallelism.
volume fractal dimensionality: a useful parameter for measuring the complexity of 3d protein spatial structures. a quantitative measure for estimating the complexity of 3d protein is proposed. the measurement is based on the fractal features of protein structures. a practical method for evaluating the volume fractal dimensionality (vfd) is described. our investigations on large data sets from pdb show that similar protein shapes have close vfd and vfd may therefore be used as a token of evolutional proteins, and for protein prediction.
agent technology for personalized information filtering: the pia-system. as today the amount of accessible information is overwhelming, the intelligent and personalized filtering of available information is a main challenge. additionally, there is a growing need for the seamless mobile and multi-modal system usage throughout the whole day to meet the requirements of the modern society ("anytime, anywhere, anyhow"). a personal information agent that is delivering the right information at the right time by accessing, filtering and presenting information in a situation-aware matter is needed. applying agent-technology is promising, because the inherent capabilities of agents like autonomy, pro- and reactiveness offer an adequate approach. we developed an agent-based personal information system called pia for collecting, filtering, and integrating information at a common point, offering access to the information by www, e-mail, sms, mms, and j2me clients. push and pull techniques are combined allowing the user to search explicitly for specific information on the one hand and to be informed automatically about relevant information divided in pre-, work and recreation slots on the other hand. in the core of the pia system advanced filtering techniques are deployed through multiple filtering agent communities for content-based and collaborative filtering. information-extracting agents are constantly gathering new relevant information from a variety of selected sources (internet, files, databases, web-services etc.). a personal agent for each user is managing the individual information provisioning, tailored to the needs of this specific user, knowing the profile, the current situation and learning from feedback.
specification and verification of agent interaction protocols in a logic-based system. in multiagent systems, agent interaction is ruled by means of interaction protocols. compliance to protocols can be hardwired in agent programs; however, this requires that only "certified" agents interact. in open societies, composed of autonomous and heterogeneous agents whose internal structure is, in general, not accessible, interaction protocols should be specified in terms of the agent observable behaviour, and compliance should be verified by an external entity.in this paper, we propose a java-prolog-chr system for verification of compliance of agents' behaviour to protocols specified in a logic-based formalism (social integrity constraints). we also present the application of the formalism and the system to the specification and verification of the fipa contract-net protocol.
hybridizing hierarchical and weighted linguistic rules. in this paper, we propose the hybridization of both hierarchical and weighted linguistic fuzzy rules to derive hierarchical systems of weighted linguistic rules. to do so, an evolutionary optimization process jointly performing a rule selection and the derivation of rule weights is developed.
pocket pc beacons: wi-fi based human tracking and following. the network-centric applied research team (n-cart) is continuing its work on an ambitious project known as the network-enabled powered wheelchair adaptor kit (nepwak) [25]. it introduces techniques for modifying and using powered wheelchairs as mobile platforms enabling communication and remote control. the wheelchair runs a pc104 based embedded server allowing both pc and pocketpc clients to connect in either infrastructure or ad-hoc mode. the clients receive audio, video and other sensory feedback from the wheelchair and can send control data for maneuvering the wheelchair. in this paper we present our preliminary work on a novel, inexpensive and coarse 'human tracking and following' system for nepwak. our approach uses a custom built highly directional steerable wi-fi antenna on the wheelchair that scans the wi-fi signal strength of its peer. this can be used to track and follow a person carrying a wi-fi enabled pocketpc.
realizing the leasing concept in corba-based applications. although in recent years the concept of leasing has become more and more popular in the field of distributed object-oriented systems, it has not yet been incorporated in the current specification of the widespread corba standard.in this paper, we present an approach to the problem of realizing the leasing concept in a corba environment. we examine different leasing variants, such as exclusive or shared leasing, leasing with or without prolongation, etc., describe different ways to implement these variants in corba, e.g., based on a specialized object adapter, a runtime library or framework, or a corba service, and we discuss the advantages and disadvantages of each approach.furthermore, we show how existing corbaservices such as naming, trading, and property service can benefit from leasing facilities. finally, we briefly present some architectural details of our own implementation of an exemplary corba leasing service.
evaluation of a language identification system for mono- and multilingual text documents. language identification is an important task for web information retrieval. this paper presents the implementation of a tool for language identification in mono- and multi-lingual documents. the tool implements four algorithms for language identification. furthermore, we present a n-gram approach for the identification of languages in multi-lingual documents. an evaluation for monolingual texts of varied length is presented. results for eight languages including ukrainian and russian are presented. it could be shown that n-gram-based approaches outperform word-based algorithms for short texts. for longer texts, the performance is comparable. the evaluation for multi-lingual documents is based on real world web documents. our tool is able to recognize the languages present in a document with reasonable accuracy.
viewpoint motion control by body position in immersive projection display. we have developed a vision-based interface based on body position for viewpoint control in an immersive projection display. the 3d position of the arms and head of the user are tracked by image processing without the need to attach devices to the user. this provides freedom of movement and increases the immersion in the virtual environment. images are captured using two high-sensitivity monochrome cameras suitable for the dark condition in the projection display. the edges of both hands and the top of the head are tracked in order to control the user's viewpoint by estimating the variance of the position. we evaluated the utility of the interface in an experiment where subjects performed walk-through trials in 3d space, comparing the body-position interface with a joystick. the results indicate that the performance of the body-position interface is comparable to that of the joystick in terms of viewpoint control, but enhances the sensation of speed. the developed system is applicable as a non-contact user interface for moving around in a virtual environment.
symbol representation in map image compression. we propose map image compression system, in which we separate text and symbol information from the rest of the data. the text and other symbols are stored as one bitmap for each symbol into a dictionary. the technical challenge of the work is to convert the symbol data directly to output format similar to that of the jbig2 standard. in this way, the text elements and special symbols are compressed more efficiently but we still have the maps in compatible raster image format.
where web engineering tool support ends: building usable websites. in this paper, two of the currently available web engineering solutions (uwe and oo-h) are analysed with regard to the question whether websites created with them and their tools have a high usability. additionally, the respective models are examined to see whether usability aspects can be expressed with them. in a small case study, an example website is created by converting a model to an implementation manually. special attention is paid to usability issues regarding both the generated pages and the development process. subsequently, the manual conversion is compared to a tool-supported process.
optimizing existential queries in stratifiable deductive databases. we reconsider query evaluation in stratifiable deductive databases using magic sets. on the basis of the soft stratification approach, a new solution to the problem of optimizing existential queries in a set-oriented database language like datalog is presented. to this end, the query answering process is optimized in such a way that after the generation of one appropriate answer fact with respect to a (derived) existential query, the redundant computations of alternative answer facts are avoided. the same technique can be employed for avoiding the generation of subsumed answers and sub-queries as well. it is shown that in presence of recursion or stratified negation this may considerably reduce the total number of facts generated.
towards low-perturbation anonymity preserving pattern discovery. it is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. in fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. we have recently shown [3], that the above belief is ill-founded: by shifting the concept of k-anonymity [8] from data to patterns, we have formally characterized the notion of a threat to anonymity in the context of frequent itemsets mining, and provided a methodology to efficiently and effectively identify such threats that might arise from the disclosure of a set of frequent itemsets. in our previous paper [2] we have introduced a first, na&iuml;ve strategy (named suppressive) to sanitize such threats. in this paper we develop a novel sanitization strategy, named additive, which outperforms the previous one in terms of the introduced distortion and has the interesting feature of maintaining the original set of frequent itemsets unchanged, while modifying only the corresponding support values.
an information retrieval model using the fuzzy proximity degree of term occurences. based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a mathematical model of information retrieval based on a fuzzy proximity degree of term occurences. our model is able to deal with boolean queries, but contrary to the traditional extensions of the basic boolean information retrieval model, it does not explicitly use a proximity operator. a single parameter allows to control the proximity degree required. with conjunctive queries, setting this parameter to low values requires a proximity at the phrase level and with high values, the required proximity can continuously be relaxed to the sentence or paragraph levels. we conducted some experiments and present the results.
design and implementation of a graphical interface to xquery. as the use of xml is rapidly growing, a growing number of users without programming skills will need to query xml data. although designed to be easily understood by humans, xquery, the xml standard query language, has the typical syntax of programming languages, which most users dislike. in this paper we describe a graphical language (xqbe) inspired by "query by example" (qbe), a popular relational query language used by ms access. xqbe covers a significant subset of xquery and is supported by a prototype enabling the formulation of queries on a graphical interface and their translation into xquery, thus providing non-trivial querying capabilities to a wide spectrum of users. simple queries are easily represented in xqbe, but many "complex" queries allow as well for an intuitive graphical representation.
multi-heuristic list scheduling genetic algorithms for task scheduling. scheduling tasks on a multi-processor system involves making a choice as to the order in which several tasks can be executed and assigned to processors. the problem is to find a schedule that will minimize the execution time of a program. because task scheduling on a multi-processor system is known to be an np-complete problem, many heuristics have been developed, each of which may find optimal or near optimal schedulings under different circumstances. list scheduling, in particular, employs heuristics to choose among all tasks that are ready to be executed, the combination of tasks that should be scheduled in the next cycle. it does this by keeping a list of "ready" tasks which is prioritized based on a particular heuristic. in this paper, we present four common heuristics used by list scheduling and compare their performance with that of our multi-heuristic based solution.the proposed solution is to use a genetic algorithm to find a combination of the four heuristics that, for a particular instance of the task scheduling problem, outperforms a scheduling based on only one of the four heuristics. we believe that, by using a mixture of the four heuristics, the size of the subset of all possible schedulings that we search increases and thus we have a higher chance of finding a better scheduling. the results of our experiments show that schedulings found with the proposed multi-heuristic list scheduling genetic algorithm outperforms those found with each one of the four list scheduling heuristics alone.
editorial message for the special track on embedded systems: applications, solutions, and techniques. recently, demand for high performance embedded computing has experienced an impressive growth. at the same time, embedded software has become more and more complex, posing new challenging issues never faced before in this application field. the need to timely tackle changes in the market pushes toward the employment of methodologies for shortening the development time and for driving the evolution of existing products. furthermore, the adoption of solutions already established in other areas of computer science (such as java technologies) can be made viable only through specific re-engineering processes. the solutions to new problems emerging in this setting call for a joint effort by academia and industry.
the agent-based programming language: apl. agent-based programming has been emerged as a new programming paradigm for the near future. there have been many research work in agent computing. however, the software engineering methodology and programming languages for agent computing are not yet sufficient and practical.this paper proposes a new programming language concept based on the bdi-agent model. the new concept has been prototyped by agent-based programming language (apl). the prototype system for apl translates the apl source into the java source codes, which can be run on the java virtual machine. this paper also describes our implementation scheme of the apl system. examples are also shown to utilize apl for the real-world banking application.