waashk/dblp huggingface dataset:
a timed extension of respect. among the existing extensions to the basic tuple space coordination model, the tuple centre approach has been introduced to allow for the flexible programming of a tuple space behaviour, so as to encapsulate coordination laws directly as behaviour of the coordination medium. in particular, the logic-based language respect has been used for programming tuple centres in the tucson coordination infrastructure [11, 9].however, among the application contexts that can be suitably engineered with agents and coordination infrastructures, some involve coordination processes where the notion of time and duration play a relevant role. examples include distributed control systems, protocol-based interactions as in auctions, and in general all the coordination contexts where high dynamism and openness are concerned, which call for time-aware coordination artifacts supporting timed system engineering.accordingly, in this work we discuss how the basic respect tuple centre model has been extended to support the definition and enaction of time-aware coordination policies. several examples are provided to show the expressiveness of the language to model temporal coordination primitives and laws.
multimedia and visualization track. the multimedia and visualization (mmv) track has been a popular track because of its appeal for the current trends in daily life applications. visualization is the key to comprehending the continuously changing complex phenomena around us. multimedia combines information from local and remote sources. the users may view this information on on-demand basis. there are many issues associated with this: data manipulation, display, motion, security etc. this track attracts investigators from pure research to applications in wide variety of areas. some of the papers included were: consistency checking and temporal relations, digital watermarking, multimedia information representation, scientific visualization with genetic algorithms, security, video indexing, video on demand, volume visualization, visualization techniques for data mining and surface modeling.
an iterative rating method: application to web-based conference management. given a large set of items and a set of users, we consider the problem of collecting user preferences - or ratings - on items. the paper describes a simple method which provides an approximate solution to the problem without requiring each user to rate each item. the method relies on an iterative process. each step, or ballot, requires each user to rate a sample of the items. a collaborative filtering algorithm is then performed to predict the missing ratings as well as their level of confidence (which is initially 0). perfoming a new ballot allows to improve the accuracy of predictions. the administrator of the system is responsible for stopping the iteration when a satisfactory level is reached.we apply this method to the assignment of reviewers to papers prior to the review phase of conference management, and describe its implementation in the myreview web-based system.
understanding access restriction of variant parametric types and java wildcards. variant parametric types [8] have been introduced to provide a flexible subtyping mechanism for generic types, and are recently being developed into java wildcards [15], shipped worldwide with the jdk 1.5 release. the two approaches, which are strictly related, retain safety by providing rather peculiar and non-trivial mechanisms to restrict access to a class functionalities (methods and fields). in this paper we aim at studying a unified framework to describe this issue in detail, and to facilitate the understanding and exploitation of this new programming concept.our work is both technical and conceptual. on the one hand, we provide formal rules to access restriction and specialise them for the two approaches, so as to emphasise similarities and differences. on the other hand, we show that such rules promote a natural description and understanding of access restriction in terms of the ability of (instances of) a generic class to produce/consume elements of the abstracted type.
rule discovery from textual data based on key phrase patterns. this paper proposes a new method for discovering rules from textual data. the method decomposes textual data into word sets by using lexical analysis, generates training examples from both key phrase relations extracted from the word sets by using key phrase patterns and text classes given by the user, and acquires key phrase relation rules from the examples by using a fuzzy inductive learning algorithm. the method is also able to deal with textual data that requires word segmentation, such as japanese text. this paper reports on the application of the method to e-mail analysis tasks for a customer center. the e-mails are written in japanese and have two analytical criteria: a product criterion and a contents criterion. we evaluate the acquired rules in each criterion.
formal specification of autonomous commerce agents. reliability is a key challenge in e-commerce platforms in general and in autonomous commerce multi-agent systems in particular. most formal methods proposed to check reliability of these systems focus on checking low-level details such as the communication protocols among agents. in this paper we present a formalism to specify autonomous commerce agents as well as systems made of them. this formalism focuses on describing the high-level behavior of agents. thus, agents are considered economic entities that have different preferences along time and must perform transactions according to them. besides, we specify systems as environments where all the agents fulfill their own specification. these formalisms can be applied to check the reliability of an agent or system by comparing its behavior with that of its specification.
improving address space randomization with a dynamic offset randomization technique. address space randomization (asr) techniques randomize process layout to prevent attackers from locating target functions. prior asr techniques have considered single-target attacks, which succeed if the attacker can locate a single, powerful system library function. these techniques are not sufficient to defend against chained return-into-lib(c) attacks, each of which calls a sequence of system library functions in order.in this paper, we propose a new asr technique, code islands, that randomizes not only the base pointers of memory mapping (mmapping), but also relative distances between functions, maximally and dynamically. our technique can minimize the utility of information gained in early probes of a chained return-into-lib(c) attack, for later stages of that attack. with a pre-defined rerandomization thresh-old, our code islands technique not only is exponentially more effective than any prior asr technique in defending against brute-force searches for locations of multiple targets---a key component of chained return-into-lib (c) attacks, but can also maintain high service availability even under attack. our overhead measurement on some well-known gnu applications shows that it takes less than 0.05 second to load/rerandomize a process with the necessary c system library functions using code islands, and our technique introduces a 3-10% run-time overhead from inter-island control transfers. we conclude that the code island technique is well-suited to dedicated multi-threaded servers.
elicitation and conversion of hidden objects and restrictions in a database schema. mapping a database schema from one model into another, with a higher semantic capacity, is a current research subject with application in several development fields, such as schema integration and translation, migration from legacy systems and reengineering of poor quality or no-longer accurate data models. inclusion dependencies are one of the most important concepts in relational databases and they are the key to perform some reengineering of database schemas. referential integrity restrictions (rir), a particular case of an inclusion constraint, requires that the set of distinct values occurring in some specified column, simple or composite (foreign key), must be a subset of the set of distinct primary key values drawn from the same domain. pure inclusion dependencies (id), however, may apply between other pairs of attributes also (alternate keys or non-keys). database schemas containing ids frequently reveal the presence of hidden objects and misrepresented relationships and, as a consequence, increase the effort to develop program applications and maintain the integrity. this work presents a heuristics for the conversion of schemas with ids into equivalent schemas with only rirs. in case some irreducible ids remain, a semantic interpretation of their necessity and maintenance is given.
adaptive linkage crossover. problem-specific knowledge is often implemented in search algorithms using heuristics to determine which search paths are to be explored at any given instant. as in other search methods, utilizing this knowledge will more quickly lead a genetic algorithm (ga) towards better results. in many problems, crucial knowledge is not found in individual components, but in the interrelations between those components. for such problems, we develop an interrelation (linkage) based crossover operator that has the advantage of liberating gas from the constraints imposed by the fixed representations generally chosen for problems. the strength of linkages between components of a chromosomal structure can be explicitly represented in a linkage matrix and used in the reproduction step to generate new individuals. for some problems, such a linkage matrix is known a priori from the nature of the problem. in other cases, the linkage matrix may be learned by successive minor adaptations during the execution of the evolutionary algorithm. this paper demonstrates the success of such an approach for several problems.
a methodology for the efficient architectural exploration of energy-delay trade-offs for embedded systems. the main goal of this paper is to identify the best architecture of an embedded system by considering at the same time energy and delay, avoiding the comprehensive analysis of the architectural design space. we adopt the energy-delay product (edp) as the evaluation metric to compare the alternative architectures of the target system. the paper analyzes an extended adaptive random search algorithm (adgreed) to efficiently explore the architectural design space. the adgreed algorithm is a pseudo-random optimisation algorithm that combines the best potentialities of the adaptive random search (adras) and the greedy deterministic algorithm. the analysis has been carried out through the architectural optimisation of the memory sub-system of a real-word embedded system executing the set of mediabench benchmarks for multimedia applications. the reported experimental results have shown a reduction up to one order of magnitude of the number of design alternatives analyzed during the exploration phase, while maintaining very high accuracy.
user-defined view automation of genomic databases. this paper presents a solution to the problem of creating a subset database from the public genome databases, also known as a database view. while the techniques to generate views are well established already in the database system there are still some problems found where applying this technique in the genome database environment. the main problems that exist in the current methods of view creation are missing relevant results, returning irrelevant results and view creation processes are generally very time consuming for the user. the solution presented within provides an automated approach aimed at reducing the time needed to create a view, which is usually done by hand. the solution improves the searching method needed for view creation by the addition of two extra phases; the first, expanding the keyword search so that it captures all relevant results and second, a filtering phase to remove all the extra irrelevant results. the whole process is done in the background so that the user isn't required to spend much time fixing the results of inadequate search tools.
j-ortho: an open-source orthodontic treatment simulator. an interactive computer-based training tool for using in orthodontics is aimed at students and experienced professionals who need to predict orthodontic treatment outcomes. usually, treatment planning and the choice of a proper appliance model are based exclusively on clinician expertise, and most orthodontists work on a trial and error basis, estimating an "ideal" loading condition that can lead to a precise and aimed tooth movement. therefore, the orthodontist and patient have a strong need for methods that enable them to compute realistic pictures of the expected teeth positioning to circumvent unexpectedly situations that may occur in practice. in this paper we present j-ortho, an open-source orthodontic treatment simulator. to validate it, we use a one-year follow-up orthodontic treatment. based on the data provided by this study, j-ortho generates the 3d anatomical structures and appliance models from dental cast, x-rays, and photographic records of the virtual patient. morphing approaches and a 3d tooth movement simulator are implemented to represent the changes in shape that the dental arch performs. initial investigation has proved that we have been able to set up the system to demonstrate behaviour that closely replicates real teeth movements, similar to our experimental studies. we expect our prototype to be a useful environment for training orthodontists, residents and students giving experience in both simulation and actual dental images as well as to explore and verify in practice the temporal evolution of the planned treatment.
the structuring of a wireless internet application for a music-on-demand service on umst devices. developing enhanced wireless internet applications is becoming one of the upcoming challenges for mobile radio networks operators. in this paper we introduce and discuss the general software architecture of a wireless internet-based application we have designed and implemented to support the distribution of mp3-based musical songs to umts devices. we have examined the effects that internet traffic has on the performance of wireless umts networks, due to the distribution of mp3 files by means of our wireless application. the download time measurements we have experimentally obtained have shown that an appropriate structuring of the internet-based wireless application may be very helpful to surmount the problems caused by the internet standard protocols which were not especially designed for wireless environments.
a comprehensive model for arbitrary result extraction. within the realms of workflow management and grid computing, scheduling of distributed services is a central issue. most schedulers balance time and cost to fit within a client's budget, while accepting explicit data dependencies between services as the best resolution for scheduling. results are extracted from one service in total, and then simply forwarded to the next service. however, distributed objects and remote services adhere to various standards for data delivery and result extraction. there are multiple means of requesting results and multiple ways of delivering those results. by examining several popular and idiosyncratic methods, we have developed a comprehensive model that combines the functionality of all component models. this model for arbitrary result extraction from distributed objects provides increased flexibility for object users, and an increased audience for module providers. in turn, intelligent schedulers may leverage these result extraction features.
discretizing aerosol dynamics with b-splines. this paper presents a discretization technique for particle dynamics equation based on the b-spline interpolation of the solution. the method is developed in the general framework recently proposed by the authors. numerical tests include the coagulation-growth of the exponential distribution and of a cosine hill in logarithmic coordinates.
short inversions and conserved gene clusters. two independent sets of recent observations on newly sequenced microbial genomes pertain to the prevalence of short inversion as a gene order rearrangement process and to the lack of conservation of gene order within conserved gene clusters. we propose a model of inversion where the key parameter is the length of the inverted fragment. we show that there is a qualitative difference in the pattern of evolution when the inversion length is small with respect to the cluster size and when it is large. this suggests an explanation of the lack of parallel gene order in conserved clusters and raises questions about the statistical validity of putative functionally selected gene clusters if these have only been tested against inappropriate null hypotheses.
navigating with inheritance in hypermedia presentations. due to significant improvements in networking, providing multimedia presentations has become a real commercial issue and a technical challenge for web tv, e-learning, commercial presentations. hyperlink in html has been designed for hyperdocuments navigation, but the actual use of hyperlinks lacks of relevant features to play continuous media such as videos. the main two issues in using hyperlink and multimedia in a web context are:(a) navigation and continuity of streamed hypermedia. in a multimedia presentation, when switching from one point to another, if the continuity of streamed media is required, then a video should not stop.(b) adaptability of the presentation in response to the user's reaction. in our approach, we consider spatial regions whose positions can change according to the user's wishes, as well as spatial regions that can appear in the presentation and preserve the continuity of streamed media.this paper addresses these two issues by considering an object oriented vision of a multimedia presentation structure. we propose a new xml based language for multimedia presentations, called arm. in this multimedia document format, we introduce the notions of spatial and temporal inheritance, and of overloading. spatial inheritance together with overloading allows to keep the same spatial structure between two or more documents, or to change this spatial shape in response to the user's activity. additionally, the temporal inheritance allows the continuity of streamed media even in the case of multiple hyperlinks (i.e., hyperlinks with more than one target).
gd-ghost: a goal-oriented self-tuning caching algorithm. a popular solution to internet performance problems is the widespread caching of data. many caching algorithms have been proposed in the literature, most attempting to optimize for one criteria or another, and recent efforts have explored the automation and self-tuning of caching algorithms in response to observed workloads. we extend these efforts to consider the goal of optimizing for selectable performance criteria. with our proposed algorithm, we have shown performance matching and exceeding the best performance of the known greedy dual-size algorithms for either object or byte hit ratios across different web workloads. gd-ghost consistently outperforms the other algorithms tested, at its worst observed performance gd-ghost exhibited equivalent miss rates to those of the best applicable greedy-dual variant, while achieving miss rates that were 25% lower than the worst performing variant. for byte miss rates, gd-ghost consistently demonstrated rates lower than the best applicable greedy-dual variant. at its best, gd-ghost offered byte miss rates 10% lower than the best variant.
a simple mathematical model of adaptive routing in wormhole k-ary n-cubes. many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. the performance characteristics of most of these algorithms have been analysed by means of software simulation only. this paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. this model requires a running time of o(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.
computer-aided law and advanced technologies. the connection between law and new advanced technologies comes from discussions originated in the different regions and nations of the world and also to create new legal models suitable with the new technology such as electronic platform for public or private services or electronic courts proceedings. said reliances are relevant in electronic commerce, whose development depends in a decisive way upon the trust of users, which is a factor of the success of innovative technologies, such as software agents and new business methods, such as marketplaces.
editorial message: special track on computer-aided law and advanced technologies. computer-aided law and advanced technology is focussed on law and advanced technologies for representing a broad and diverse forum for the discussion of research in computer-aided law, one that can provide synergies when aligned with other areas within the sac. the track has the specific objectives of joining the technical materials to legal framework with the aim to build the necessary infrastructure for preparing socio-legal, economic and statistical studies and organisational and regulatory proposals (rules of law, standards and codes of conduct). the hope is to develope modules in ict law and the technical platform both legal issues and computer science and engineers issues.
efficient first-class generics on stock java virtual machines. the second-class formulation of generics in java 5.0 discards generic type information during compilation. as a result, java 5.0 prohibits run-time type-dependent operations, generates unavoidable unchecked warnings (type errors) during compilation, and causes unexpected behavior during execution. the nextgen generic java compiler eliminates these pathologies by retaining parametric type information at runtime and customizing the code in generic classes and polymorphic methods where necessary to support (parametric) type-dependent operations. nextgen is a production compiler for the entire java 5.0 language; it executes on standard jvms and is backward compatible with existing libraries and other binaries. benchmarks show that the first-class implementation of generic types in nextgen has essentially the same performance as java 5.0 and significanlty outperforms alternative first-class implementation architectures.
accessee controlled type selection for a multiple-type object. inada is an enhanced c++ persistent programming language, compliant with odmg standard. inada supports multiple-type objects facility which enables any persistent objects to obtain any type at any time the type is needed, and to lose any unnecessary types dynamically. using the facility, we can model changes in roles/aspects which a real-world entity possesses. access to a multiple-type object needs to select one from among its own types. the selection is conventionally left to an object accessing a multiple-type object. a real-world entity is, however, flexible enough to decide its roles/aspects depending on a meeting entity whom it exchanges messages with. from the consideration, this paper proposes <u>a</u>ccess<u>ee</u> controlled type selection (aee) method in which a multiple-type object selects one from among its own types depending on an object accessing it. the implementation of aee method in inada is also presented, which does not need any modification to the language specification and the processing system of inada.