waashk/dblp huggingface dataset:
using multimedia to emphasize the development of professional abilities. this paper presents the content of a lesson unit issued from the television distance education course information technology. it is a mandatory course of the undergraduate program of computer science from universit&eacute; laval. several television programs were used to favor the development of professional abilities needed in the workplace. the first part of this paper summarizes the knowledge that students must acquire. the second part emphasizes the use of television to favor the emergence of the needed professional abilities.
automatic fitting of cochlear implants with evolutionary algorithms. this paper presents an optimisation algorithm designed to perform in-situ automatic fitting of cochlear implants.all patients are different, which means that cochlear parametrisation is a difficult and long task, with results ranging from perfect blind speech recognition to patients who cannot make anything out of their implant and just turn it off.the proposed method combines evolutionary algorithms and medical expertise to achieve autonomous interactive fitting through a personal digital assistant (pda).
supporting e-commerce systems formalization with choreography languages. e-commerce as well as b2b applications are essentially based on interactions between different people and organizations (e.g. industry, banks, customers) that usually exploit the internet as communication media. web services provide a mean to deal with these aspects. in this paper we show, via a case study, how choreography and orchestration languages allow us to express behaviour policies between the involved entities (interactions modalities, interdependencies, security requirements); in particular we consider that they can be used not only for describing behavioural rules but also for designing and testing whether the involved entities move according with system specifications.
marshaling and unmarshaling models using the entity-relationship model. software systems are usually designed and documented with the aid of visual modeling notations. visual modeling notations keep evolving over the years in tandem with visual modeling tools, and the tight binding in between impedes the exchanging of modeling assets, which causes a spatial isolation of the models. another problem with legacy software models is that they are isolated temporally in the early phases of the software engineering life cycle without reaching out to the later phases. this paper presents an approach for breaking both spatial and temporal isolation of software models by marshaling and unmarshaling models using the entity-relationship (er) model, thus providing a promising way for evolving model-driven software development.
an interactive evolutionary algorithm for cochlear implant fitting: first results. in a previous sac-compahec paper[1], a method was presented using an interactive evolutionary algorithm for cochlear implants fitting.the method has recently been put to test, with very unexpected and encouraging results: in a few words, it seems that the algorithm is capable to obtain much better results than an expert practitioner in many cases.the solutions proposed by the algorithm are counter-intuitive, yet they improve speech recognition drastically. if these preliminary results are confirmed by many more cases, it could mean that experts have been deterministically tuning cochlear implants the wrong way for many years.however, it seems that the very good results obtained by the algorithm depend a lot on the acoustic environment in which the fitting is performed. a broader fitting scheme has therefore been implemented that should overcome this problem, by allowing the patient to sample typical background noises for which the prosthesis should be specifically tuned.in the future, a piece of software will be added to the cochlear implant signal processor that will automatically choose the best setting depending on the kind of sound environment picked up by the microphone.
approximate xml document matching. regular hedge grammar is a formal method to specify xml schema. xml document can be viewed as an ordered labeled tree. computing the approximate matching between an xml document with a schema with minimum cost is not only theoretically interesting. this problem can be modeled as: given an ordered labeled tree f and a regular hedge grammar p, how to compute the minimum edit distance to transform the forest f into f' so that f' is exactly matched by p. in this paper, with the introduction of leaf forest, we gave an algorithm for this problem in o(f2p(f + log p)) time, where f is the size of the forest and p is the size of the grammar. from the authors' knowledge, this is the first algorithm to transform an xml document (ordered labeled tree) to conform to a schema (tree grammar).
supporting change request assignment in open source development. software repositories, such as cvs and bugzilla, provide a huge amount of data regarding, respectively, source code and change request history. in this paper we propose a study on how change requests have been assigned to developers involved in an open source project and a method to suggest the set of best candidate developers to resolve a new change request. the method is based on the hypothesis that, given a new change request, developers that have resolved similar change requests in the past are the best candidates to resolve the new one. the suggestion can be useful for project managers in order to choose the best candidate to resolve a particular change request and/or to construct a competence database of developers working on software projects. we use the textual description of change requests stored in software repositories to index developers as documents in an information retrieval system. an information retrieval method is then applied to retrieve the candidate developers using the textual description of a new change request as a query.case and evaluation study of the analysis and the methods introduced in this paper has been conducted on two large open source projects, mozilla and kde.
keynote address: towards secure systems programming languages. the modern world is increasingly dependent on software, and yet the software we use is often manifestly insecure and unreliable. it seems only a matter of time until a "cyber-pearl harbor" occurs. as a result, we can expect future systems to be programmed in safer, higher-level languages. we discuss characteristics of such systems and languages, and how they help obtain the apparently conflicting goals of flexibility and reliability.
confirming the influence of educational background in pair-design knowledge through experiments. the sharing of tacit knowledge is a strategic factor for the success of software process, from a number of perspectives: training, project assimilation, and reducing noise in knowledge transfer. pair programming is supposed to be a practice suitable for this purpose. unfortunately, the building of tacit knowledge is determined by factors that are difficult to isolate and capture because they concern personal attitude and capability. thus, we have focused on the possible causes forming the individual ability, that can be isolated and studied, such as the individual education background. we have applied the practice of working in pairs to the design phase. we have made an experiment and a replica in academic environment, in order to understand the relationship between the building of knowledge through the practice and the individual background. in this paper we discuss the replica and compare the results with the first experiment's ones.
discovering interesting information in xml data with association rules. data mining algorithms are designed to extract interesting information from large amounts of data. they usually assume that source data are in relational (tabular) from. however, the recent success of xml as a standard to represent semi-structured data and the increasing amount of data available in xml pose new challenges to the data mining community. in this paper we introduce association rules for xml data. to accomplish this, we propose a new operator, based on xpath and inspired by the syntax of xquery, which allows us to express complex mining tasks, compactly and intuitively. the operator can indifferently (and simultaneously) target both the content and the structure of the data, since the distinction in xml is slight.
a control theory based framework for dynamic adaptable systems. the increasingly complex environments in which systems need to execute has lead to the need for tools and techniques to systematically design dynamically adaptable systems. a new framework for the design of these adaptive systems is proposed here. the framework, named smart (state model adaptive run time), is based on the mathematics of control theory and system identification techniques. this foundation allows the system to accurately predict constraint violations in the environment, such as a memory overflow, and avert them by selecting components that better utilize a particular resource. the result is a more robust system. an example of the application of smart is presented to show the need and applicability of the framework. experimental results demonstrate the framework has an 86% accuracy in predicting and averting memory constraint violations. these results indicate the smart framework is feasible and has the potential to be a useful design solution for dynamic adaptable systems. improvements to the framework are proposed as future work.
method construction - a core approach to organizational engineering. dominated by the behavioral science approach for a long time, information systems research increasingly acknowledges design science as a complementary approach. while primarily information systems instantiations, but also constructs and models have been discussed quite comprehensively, the design of methods is addressed rarely. but methods appear to be of utmost importance particularly for organizational engineering. this paper justifies method construction as a core approach to organizational engineering. based on a discussion of fundamental scientific positions in general and approaches to information systems research in particular, appropriate conceptualizations of 'method' and 'method construction' are presented. these conceptualizations are then discussed regarding their capability of supporting organizational engineering. our analysis is located on a meta level: method construction is conceptualized and integrated from a large number of references. method instantiations or method engineering approaches however are only referenced and not described in detail.
investigating 'internet crimes against children' (icac) cases in the state of florida. the purpose of this article is to highlight efforts by the computer crime center at the florida department of law enforcement (fdle) to prosecute icac cases under their jurisdiction. section 1 presents an overview of the fdle icac initiative, a project funded by the florida department of children and families (dcf) with respect to: (i) project goals and objectives, (ii) agent/analyst training and deployment, (iii) collaboration with other law enforcement agencies, (iv) arrest rates, and (v) community education programs. section 2 focuses on the internet and how it is contributing to the rising incidence of sexual exploitation of children by online predators. in particular, this section underscores the computer's appeal for both the offender and the victim. section 3 describes noteworthy cases that have been investigated by the fdle computer crime center. the first three sections provide the context for the last two sections which focus exclusively on the type of forensics required to successfully prosecute icac cases. in section 4, the main investigative steps are delineated. to illustrate how icac cases are handled, the article depicts the two main components of an investigation: first, subpoenas are issued, search warrants are served and executed, and then, once the evidence is acquired, law enforcement officials conduct a forensic exam on the computers and other digital evidence that may have been seized during an investigation. finally, section 5 concludes with a set of recommendations on 'best practices' for prosecuting icac cases.
a comparison of several predictive algorithms for collaborative filtering on multi-valued ratings. the basic objective of a predictive algorithm for collaborative filtering (cf) is to suggest items to a particular user based on his/her preferences and other users with similar interests. many algorithms have been proposed for cf, and some works comparing sub-sets of them can be found in the literature; however, more comprehensive comparisons are not available. in this work, a meaningful sample of cf algorithms widely reported in the literature were chosen for analysis; they represent different stages in the evolutive process of cf, starting from simple user correlations, going through online learning, up to methods which use classification techniques. our main purpose is to compare these algorithms when applied on multi-valued ratings.experiments were conducted on three well-known datasets with different characteristics, using two protocols and four evaluation metrics, representing coverage, accuracy, reliability and agreement of predictions with respect to real values. results from such experiments showed that the memory-based method is a good option because its results are more precise and reliable compared with the other methods. online learning methods exhibit a good level of accuracy with low variation, which makes them reliable models. on the other hand, support vector machines generate predictions with acceptable agreement; however, their accuracy depends on the characteristics of the input data. finally, dependency networks did not offer good results when applied on multi-valued rankings. the run experiments confirm that the characteristics of datasets keep being an important factor in the performance of methods.
static analysis of time bounded reactive properties of boolean symbols. we present a method for checking if macro-definitions written in c respect their specification. we are interested in simple time-bounded reactive properties. we use the abstract interpretation framework and a compact representation of sets of traces to provide a formalization of the specification, the semantics and the algorithms allowing us to build a representation of the set of traces.
discovery and regeneration of hidden emails. the popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. one challenge that has not been studied extensively in text mining is the reconstruction of hidden emails. a hidden email is an original email that has been quoted in subsequent emails but is not itself present in the folder; it may have been deleted or may never have been received. this paper proposes a method for reconstructing hidden emails using the embedded quotations found in messages further down the thread hierarchy. to do so, we model all the quoted fragments in a precedence graph, from which hidden emails are regenerated as bulletized documents. the bulletized model is our solution to the situation when a total ordering of fragment is not possible. we give a necessary and sufficient condition for each component of the precedence graph to be captured in a single bulletized email, and we develop heuristics that minimize the number of regenerated emails when the condition is not met. finally, we present empirical results showing the scalability of our approach.
an efficient time representation for real-time embedded systems. real-time systems should provide a time representation mechanism which allows to specify timing constraints in a wide range and with sufficiently high resolution. moreover, the system lifetime (that is, the longest absolute time that can be handled by the system) should be as long as possible, or possibly infinite. in powerful architectures, this goal is achieved by representing time through variables with a large number of bits. unfortunately, in real-time embedded systems with small memory requirements, such a solution cannot be used, and a trade off needs to be found for memory, system resolution and the longest representable timing constraint. in such systems, the runtime overhead introduced by the time representation mechanism is also crucial and needs to be taken into account.in this paper we present an efficient method for time representation suited for small embedded systems. the method allows to achieve an infinite lifetime, high resolution and deal with sufficiently large timing constraints. the proposed approach is compared with other methods proposed in the literature and it is proved to be more efficient in terms of both overhead and memory requirements. the method allows an efficient implementation of deadline-based scheduling algorithms (such as edf) and time accounting mechanisms for capacity based servers and resource reservation policies. the proposed technique has also been implemented and tested in two real-time kernels for small embedded microcontrollers.
differences between the iterated prisoner's dilemma and the chicken game under noisy conditions. the prisoner's dilemma has evolved into a standard game for analyzing the success of cooperative strategies in repeated games. with the aim of investigating the behavior of strategies in some alternative games we analyzed the outcome of iterated games for both the prisoner's dilemma and the chicken game. in the chicken game, mutual defection is punished more strongly than in the prisoner's dilemma, and yields the lowest fitness. we also ran our analyses under different levels of noise. the results reveal a striking difference in the outcome between the games. iterated chicken game needed more generations to find a winning strategy. it also favored nice, forgiving strategies able to forgive a defection from an opponent. in particular the well-known strategy tit-for-tat has a poor successrate under noisy conditions. the chicken game conditions may be relatively common in other sciences, and therefore we suggest that this game should receive more interest as a cooperative game from researchers within computer science.
high throughput reliable message dissemination. we consider applications that require high rate, reliable message dissemination in a many-to-many environment. examples of such applications include stock market centers and synchronized server clusters. as network capacity increases, the achievable throughput of messaging applications becomes bounded by processing times rather than communication speed. to reduce processing times we suggest the use of message aggregation. we consider performing message aggregation at either the sender, a message-server, or a network switch. the performance of each of these methods in terms of throughput and delay is analytically evaluated and compared against that of a naive implementation that does not perform message aggregation. we show that in typical real-world messaging applications, performing message aggregation can increase throughput by order of magnitude.we base our results on experiments that have been conducted using various operating systems running on different hardware platforms. our results indicate that the achievable throughput of messaging applications is determined by the number of packets-per-second, rather than bytes-per-second, a receiver or a transmitter should handle.
wireless spatio-semantic transactions on multimedia datasets. advances in spatially enabled semantic computing can provide situation aware assistance for mobile users. this intelligent and context-aware technology presents the right information at the right time, place and situation by exploiting semantically referenced data for knowledge discovery. the system takes advantage of new metadata standards to enable semantic, user, and device adapted transactions on multimedia datasets. information accessed in the past and the activities planned by the user, the situation dependencies (e.g. location) of these activities are used to infer future information requirements. the focus of this paper describes an application of the above functionalities for performing mobile context-aware queries and updating of a multimedia spatial database of cultural heritage artifacts concerning early 20th century dublin. it aims to exploit current consumer trends in mobile device usage by opening new markets for the increasing number of visitors to dublin's streets. an ongoing development of this technology, the project mocha (mobile cultural heritage adventures), will allow the mobile cultural heritage consumer to explore a personally tailored view of dublin's treasured artefacts, historical events and districts in an interactive and intuitive way directly on their spatially enabled pda.
using mobile agents as roaming security guards to test and improve security of hosts and networks. this paper discusses the design and implementation details of mast (mobile agent-based security tool), a new mobile agent-based network security approach. mast has been designed to support flexible and customizable network security tasks and training. this paper focuses on the implementation details and security aspects of mast's components, services, and mobile-agent architecture
coordinating functional processes with haskell. this paper presents haskell#, a parallel functional language based on coordination. haskell# supports lazy stream communication and facilities, at coordination level, to the specification of data parallel programs. haskell# supports a clean and complete, semantic and syntactic, separation between coordination and computation levels of programming, with several benefits to parallel program engineering. the implementation of some well-known applications in haskell# is presented, demonstrating its expressiveness, allowing for elegant, simple, and concise specification of any static pattern of parallel, concurrent or distributed computation.
a parallel algorithm for the extraction of structured motifs. in this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. this algorithm, based on an existing approach, extracts structured motifs, that consist of an ordered collection of p &ge; 1 boxes with sizes and spacings between them specified by given parameters. the contents of the boxes, which represent the extracted motifs, are unknown at the start of the process and are found by the algorithm using a suffix tree as the fundamental data structure. by partitioning the structured motif searching space we divide the most demanding part of the algorithm by a number of processors that can be loosely coupled. in this way we obtain, under conditions that are easily met, a speedup that is linear on the number of available processing units. this speedup is verified by both theoretical and experimental analysis, also presented in this paper.
a chat interface for human-agent interaction in mast. in this paper we introduce a group-messaging interface that allows humans to efficiently interact with a group of agents through a hierarchical and customizable text protocol. our approach is presented in the context of the mast mobile agent-based framework for security and administration of large scale computer networks. the mast framework is primarily human-centric and directly supports human-agent interaction that enables customized agents to notify administrators and react to abnormal environmental conditions. the proposed irc-like interface was developed and tested in the context of mast. in this paper we present the group-manager interface in contrast with other agent interfaces currently available in the mast framework.