waashk/dblp huggingface dataset:
a personalized framework for trust assessment. the number of computational trust models has been increasing quickly in recent years yet their applications for automating trust evaluation are still limited. the main obstacle is the difficulties in selecting a suitable trust model and adapting it for particular trust modeling requirements, which varies greatly due to the subjectivity of human trust. the personalized trust framework (ptf) presented in this paper aims to address this problem by providing a mechanism for human users to capture their trust evaluation process in order for it to be replicated by computers. in more details, a user can specify how he selects a trust model based on information about the subject whose trustworthiness he needs to evaluate and how that trust model is configured. this trust evaluation process is then automated by the ptf making use of the trust models flexibly plugged into the ptf by the user. by so doing, the ptf enable users reuse and personalize existing trust models to suit their requirements without having to reprogram those models.
term distribution visualizations with focus+context. many text searches are meant to identify one particular fact or one particular section of a document. unfortunately, predominant search paradigms focus mostly on identifying relevant documents and leave the burden of within-document searching on the user. this research explores term distribution visualizations as a means to more clearly identify both the relevance of documents and the location of specific information within them. we present a set of term distribution visualizations and introduce a focus+context model for within-document search and navigation.
applying latent dirichlet allocation to group discovery in large graphs. this paper introduces lda-g, a scalable bayesian approach to finding latent group structures in large real-world graph data. existing bayesian approaches for group discovery (such as infinite relational models) have only been applied to small graphs with a couple of hundred nodes. lda-g (short for latent dirichlet allocation for graphs) utilizes a well-known topic modeling algorithm to find latent group structure. specifically, we modify latent dirichlet allocation (lda) to operate on graph data instead of text corpora. our modifications reflect the differences between real-world graph data and text corpora (e.g., a node's neighbor count vs. a document's word count). in our empirical study, we apply lda-g to several large graphs (with thousands of nodes) from pubmed (a scientific publication repository). we compare lda-g's quantitative performance on link prediction with two existing approaches: one bayesian (namely, infinite relational model) and one non-bayesian (namely, cross-association). on average, lda-g outperforms irm by 15% and cross-association by 25% (in terms of area under the roc curve). furthermore, we demonstrate that lda-g can discover useful qualitative information.
infinite bar-joint frameworks. some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. in the first sufficient conditions, of a uniform local nature, are obtained for the existence of a proper flex of an infinite framework. in the second it is shown how continuous paths in the plane may be simulated by infinite kempe linkages.
optimizing techniques for saturated arithmetic with first-order linear recurrence. saturated arithmetic is a typical operation in multimedia applications, most multimedia extensions in the instruction set architecture (isa) of modern processors provide saturation instructions for such operation. therefore, extensive researches have focused on how to utilize saturation instructions to optimize programs. previous algorithms mainly focus on purely saturated arithmetic, however saturated arithmetic is often mingled with first-order linear recurrence (folr) in real life applications. when flor pattern appears in the program, previous algorithms can not identify the saturated arithmetic as well. in fact, the saturated arithmetic with folr (sawf) is a new and significant pattern, especially, sawf with one as coefficient is frequently used in multimedia applications. hence, it is necessary to explore a method with which such pattern can be efficiently vectorized. this paper discusses how to vectorize sawf, explores the efficient method to vectorize sawf with one as coefficient and gives its evaluation and implement a library for the optimizing technique. such an implementation manner can make compilers are able to exploit it more easily. the experimental results shows the optimizing technique can achieve a speedup of 1.19 to 1.46 on pentium iv processor. at the same time, the optimizing techniques in this paper can also be used to develop a library for sawf so a programmer can benefit even without changing the compiler.
atm: an automatic trust monitoring algorithm for service software. while providing services to stakeholders, service software can be exploited by potentially untrustworthy users. given that, it is necessary to monitor the trust relationships between service providers and requestors for potential vulnerabilities they may invite to the total system. in this paper, we propose an automatic trust monitoring algorithm called atm based on the specification of trust relationships in trust scenarios and the quantification of the relationships through trust calculation schemes. trust rules are generated from the trust scenarios ready to be deployed at run-time. a service requestor is penalized for the violation of a trust rule and rewarded for no such violation. this analysis facilitates the quantification of the trustworthiness of service requestors and the accuracy of the recommendations from other service providers that can be used to make dynamic decisions on the corresponding requestors. the monitor is implemented in a prototype file sharing grid and evaluated using file sharing applications.
vector stream processing for effective application of heterogeneous parallelism. heterogeneous multicore chipsets with many levels of parallelism are becoming increasingly common in high-performance computing systems. effective use of parallelism in these new chipsets is paramount. we present a 3d chemical transport module optimized for the cell broadband engine architecture (cbea). by leveraging the heterogeneous parallelism of the cell with a method we call vector stream processing, our transport module achieves performance comparable to two nodes of an ibm bluegene/p, or eight xeon cores, on a single cell chip. performance of the module on two cbea systems, an ibm bluegene/p, and an eight-core shared-memory intel xeon workstation are given.
the sum-of-increments constraint in the consecutive-ones matrix decomposition problem. the combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer radiotherapy delivery planning. a fast constraint programming approach for this problem exists. i present a propagation algorithm for a constraint in this approach that can speed up solving by an order of magnitude.
designing a distributed aop runtime composition model. in this paper we present damon, a new distributed aspect-oriented composition model. our model mimics the ccm and is based on computational reflection, component-based design, and separation of concerns. moreover, we benefit from the peer-to-peer substrate to implement these services in a decentralized and efficient way. damon aims to provide new distributed concerns (i.e. replication) to existent or new applications transparently. it reduces the complexity of application development and allows runtime reconfiguring. the innovative contributions of our approach are composition capabilities in design, load-time and runtime phases, including the definition of distributed aspects and meta-aspects.
designing of a system model for web 3d disabled access gis on web 2.0. this paper aims to propose our study of system model design for a web 3d disabled access gis. the disabled access gis provides the disabled with information on barriers and barrier-free modifications in consideration of their abilities and psychologies. we model the system for web-based accesses. it enhances its reusability and mash-up capability. our model clearly divides database access, server-side service and client-side user interface. we implemented desktop client and mobile phone client to examine the model.
adaptive optimal checkpoint interval and its impact on system's overall quality in soft real-time applications. soft real-time systems often have to consider both timing and probabilistic fault-tolerance requirements. when checkpointing techniques are used for fault tolerance purposes, the checkpointing frequency unyieldingly affects the system's overall quality measured by an integrated value of system qos properties, such as availability, task execution time, and task deadline miss probability. in this paper, we first formally analyze the relationships between checkpoint interval and system availability, task execution time, and task deadline miss probability, respectively by considering a poisson probabilistic fault model. we further define the system's overall quality as a weighted sum of these three qos measures, from which an optimization problem is formulated to decide the checkpoint interval that maximizes system's overall quality. also presented in the paper are a prototype implementation of a framework that allows adaptive checkpointing and a set of experiments executed upon the framework that further validate our analytical results.
requirements engineering using appreciative inquiry for an online community of caregivers of children with autism. appreciative inquiry, commonly used in organizational development, aims to build organizations, processes or systems based on success stories using a hopeful vision for an ideal future. it produces positive results with organizational change management. we adjusted the user requirements process for an online community of caregivers of children with autism and compared it with the traditional approach. based on case studies with 4 special education teachers, we found that appreciative inquiry was effective for obtaining meaningful requirements and extremely useful in encouraging buy-in with novice users. this outcome was in stark contrast to the traditional approach where our participants showed no interest in an online community. in addition to these results, we present lessons learned in adjusting the appreciative inquiry process for user requirements analysis.
forensic bite mark identification using image processing methods. forensic dentistry generally addresses the problem of identifying individuals based on the properties of teeth or identifying individuals based on bite mark impressions. it is legally relevant to accurately and reliably match a bite mark impression to place a criminal at the scene of a crime. therefore, a system which minimizes human interaction to conduct the comparison would be beneficial to ensure accuracy and reduce human bias. this paper describes experiments with developing a semi-automated method to compare 3d dental models taken from candidate humans and bite mark impression images left in the scene of the crime. once the contours from the bite mark image and the 3-dimensional dental model are captured, the ideal alignment is calculated by finding the transformation which minimizes a distance measure. the best match is then identified by performing this comparison to a set of candidate dental models. the results are compared to identification results by human forensic odontology experts.
response time analysis of software transactional memory-based distributed real-time systems. we consider distributed real-time systems where concurrency control is managed using software transactional memory (or stm). for such a method we propose an algorithm to compute an upper bound on the response time. we compare the result of the proposed algorithm to a simulation of the system being studied in order to determine its efficacy. the results of our study indicate that it is possible to provide timeliness assurances for systems programmed using stm.
a pointing method using two accelerometers for wearable computing. a variety of real-world situations are beneficial for wearable computing since it provides information services while users are doing other jobs. therefore, a simple and hands-free input interfaces have suitable for these computer operations. however, such interface has not been achieved with conventional input devices such as mice or track balls. although gesture or eye-gaze input techniques have also been developed for wearable computing, they also suffer from problems i.e., a slow pointing speed, difficulty in carrying devices, and complexity in parallel use when doing tasks. we propose a new method of pointing using input of simple gestures with two accelerometers. by dividing the specifications of two coordinates into a combination of two independent motions, we accomplish accurate and intuitive pointing. a user attaches two small accelerometers to both his/her hands or both elbows. the pointing is done by using the intersection of two straight lines, and the movement of the lines is synchronized with that of the accelerometers. in addition, we also propose a method of changing the position of objects being pointed at that is new approach. the results we obtained from our evaluation experiments confirmed that our method was effective.
on the verification of probabilistic i/o automata with unspecified rates. we consider the probabilistic i/o automata framework, for which we address the verification of reachability properties in case the rates (also called delay parameters) are unspecified. we show that the problem of finding (or even approximating) the supremum probability that a set of states is reached is undecidable. however, we give an algorithm to obtain a non-trivial over-estimation of this value. we explain why this over-estimation may result useful for many systems. finally, in order to compare our approach against markov decision processes, we study a simple protocol for anonymous fair service. in this case, the over-estimation computed over the pioa gives a more realistic result than the exact computation over the mdp.
an approach to identifying conversation dependency in service oriented system during dynamic evolution. dynamic evolution is required in soas (service oriented architecture) with complex business processes to adapt to the opening environment of internet and ever changing requirement of user. this paper proposes an approach to identifying conversation dependency between business processes to facilitate the dynamic evolution. in our approach, a business process is represented as a directed graph, and the matrix method is used to identify the execution order of activities in the business process, which determines the conversation dependency.
static type inference for ruby. many general-purpose, object-oriented scripting languages are dynamically typed, which provides flexibility but leaves the programmer without the benefits of static typing, including early error detection and the documentation provided by type annotations. this paper describes diamondback ruby (druby), a tool that blends ruby's dynamic type system with a static typing discipline. druby provides a type language that is rich enough to precisely type ruby code we have encountered, without unneeded complexity. when possible, druby infers static types to discover type errors in ruby programs. when necessary, the programmer can provide druby with annotations that assign static types to dynamic code. these annotations are checked at run time, isolating type errors to unverified code. we applied druby to a suite of benchmarks and found several bugs that would cause run-time type errors. druby also reported a number of warnings that reveal questionable programming practices in the benchmarks. we believe that druby takes a major step toward bringing the benefits of combined static and dynamic typing to ruby and other object-oriented languages.
bipolar query satisfaction using satisfaction and dissatisfaction degrees: bipolar satisfaction degrees. since many years, research on flexible querying of regular databases aims at making database systems better accessible, and this by allowing queries to be formulated in a more human consistent manner. in general, this is done by allowing the user to express preferences, which are not necessarily strict, but can be approximately specified. as a result, a satisfaction degree can be calculated for each record in the database, expressing the degree to which the particular record satisfies the users preferences. in addition to this, bipolar querying adds the notion of both positive and negative preferences in handling flexible queries. the reason for this is that it is sometimes more feasible for a user to express what is undesirable than to express what is desirable. moreover, satisfactory and unsatisfactory cases do not necessarily have to be each others reverse, which is called heterogeneous bipolarity. to deal with this heterogeneous bipolarity, this paper introduces a new bipolar query satisfaction modeling framework, where, besides a satisfaction degree, also an independent dissatisfaction degree is used.
requirements modelling and evaluation for digital preservation: a cots selection method based on controlled experimentation. most methods for the general problem of commercial-off-the-shelf component selection use goal-oriented requirements modelling and multi-criteria decision making techniques and are applicable across a wide range of domains. this usually implies high levels of complexity. recently a very specific selection problem emerged in the context of digital preservation. the selection of the most suitable tool to keep a type of digital object alive when the original technical environment ceases to exist is a highly complex domain-specific selection problem with several peculiarities: highly homogeneous functionality across tools, complex evaluation of quality across settings, and a high need for automation, standardisation, and documentation. this paper describes an evidence-based empirical methodology for cots component selection in digital preservation through controlled experimentation. we describe the specific selection problem, show how the process of utility analysis can be tailored to fit the problem space and describe the methodology, which is geared towards automated evaluation in an empirical setting. we outline existing tool support and discuss case studies and future directions.
opportunistic real-time routing in multi-hop wireless sensor networks. wireless sensor networks (wsns) are subject to significant resource constraints. particularly, routing protocols for low-rate wsns suffer from maintaining routing metrics and stable links of paths. even though opportunistic routing protocols are well-suited to wsns, they have some weaknesses for supporting real-time data and low power consumption. this paper proposes a new routing protocol called opportunistic real time routing (or ortr) that guarantees delivery of data under time constraints with efficient power consumption. in order to satisfy time requirements, an area where real-time data must be delivered is defined with effective transmission power and a relay node within the area is selected for the purpose of balancing overall energy levels. we compare existing routing protocols against ortr through a set of simulation experiments. our simulation results illustrate that ortr provides guaranteed real-time service with optimal transmission power without degrading the energy balance.
towards "wydiwys" for mimi using concept analysis. this paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of "wydiwys" - what you do is what you see. this approach establishes an engineering procedure for applying formal concept analysis (fca) [3] in user requirement analysis, system design and implementation. the fca lattice diagrams facilitate the design of a role-based web interface by contributing to the analysis of relationships between roles, functionalities, and database access actions. as a result, they help identifying privileges that are needed by each role to perform required functionalities and page partials and views as web interface components. additionally, the relabeled fca lattices direct developers in adding privilege checks in the page partial or view components to help implement the desired access control architecture. the fca based approach is demonstrated in the development of mimi, a multi-modality, multi-resource, information integration environment for the nci-designated case comprehensive cancer center (case ccc). we present the resulting hierarchical lattice diagrams and show that the fca-based approach benefits the life-cycle development process for mimi's complex web interface.
foreground classification using active template in the scene context for visual surveillance. this paper presents an integrated framework for real-time target category recognition integrating the active template matching and the context of visual surveillance. the active templates are in the form of a dictionary of active features (bases), which are allowed to slightly shift at different locations and orientations. they can be learned for each object type from a small set of positive samples that roughly aligned. with these learned deformable templates, the moving foregrounds subtracted from background model are recognized through searching maximum matching likelihood. to avoid the exhaustive search for template matching and reduce the noise disturbance, a scheme to estimate target size and pose at specific location is developed based on the contextual information of scene geometry. this framework can be an independent module embedded into a visual surveillance system. its performance and benefit of using context are quantitatively demonstrated on public dataset with comparisons.
towards inference of more realistic xsds. the xml has undoubtedly become a standard for data representation and manipulation. but most of xml documents are still created without the respective description of their structure, i.e. an xml schema. hence, in this paper we focus on the problem of automatic inferring of an xml schema for a given sample set of xml documents. contrary to existing works, whose aim is to infer as concise schema as possible, we focus on inferring of a more realistic result, i.e. a schema that is closer to human-written ones and bears more precise information. for this purpose we extend and combine the existing verified techniques (such as aco heuristics or mdl principle) with a set of heuristics exploiting semantics of element/attribute names, thesauri or statistical analysis of input data. using a set of examples we show and discuss advantages of our proposal.
an ontology-based application in heart electrophysiology: representation, reasoning and visualization on the web. computational technologies have been increasingly explored to make biomedical knowledge and data more accessible for human understanding, comparison, analysis and communication. in this context, ontology has been recognized in the bioinformatics literature as a suitable technique for advancing knowledge and data representations in biomedicine. moreover, automated reasoning and visualization mechanisms can favor in providing support for human comprehensibility as well as in dealing with the complexity inherent to this domain. this paper elaborates on the application of ontology for heart electrophysiology representation, reasoning and visualization on the web. the ontology-based application we propose can be used to offer support for interactive learning in heart electrophysiology.