waashk/dblp huggingface dataset:
super-resolution image reconstruction using the generalized isotropic multi-level logistic model. high spatial resolution images are usually required in a great number of applications such as video surveillance, for instance. super-resolution reconstruction methods use image processing techniques to estimate a high-resolution image based on a set of low-resolution observations of the same scene. therefore, these methods are able to overcome cost and hardware limitations inherent to acquisition devices. this paper discusses a maximum a posteriori probability approach, characterizing the high-resolution estimation with the isotropic multi-level logistic model that incorporates pixel similarity in a meaningful way to the super-resolution context. following, the high-resolution estimation is derived by maximizing the local conditional probabilities sequentially with the iterated conditional modes algorithm. the proposed method was evaluated in a simulated framework using the normalized mean square error criterion, and in a real situation using video frames. the results indicate the effectiveness of our approach both by numerical and visual evaluation.
annotating uddi registries to support the management of composite services. the future of service-centric environments suggests that organizations will dynamically discover and utilize web services for new business processes particularly those that span multiple organizations. however, as service-oriented architectures mature, it may be impractical for organizations to discover services and orchestrate new business processes on a daily, case-by-case basis. it is more likely that organizations will naturally aggregate themselves into groups of collaborating partners that routinely share services. in such cases, there is a requirement to maintain an organizational memory with regards to the capabilities offered by other enterprises and how they fit within relevant business processes. as a result, registries must maintain information about past business processes (i.e. relevant web services and their performance, availability, and reliability). this paper discusses and evaluates several hybrid approaches for incorporating business process information into standards-based service registries.
improved adaboost.m1 of decision trees with confidence-rated predictions. this paper proposes an algorithm to integrate adaboost.m1 with the decision trees that output confidence-rated predictions, which is done by transforming decision trees from "expert" models to "specialist" models that may abstain when the confidence is less than 1/2. the confidence is used to update the instance weights during the boosting process, and it is also used to determine the vote weights of base classifiers in decision process. this makes the algorithm a "dynamic" one, in that: (1) for a given test instance, only those whose confidences are higher than 1/2 can vote on the decision making; and (2) the vote weight of each base classifier is dependent on the confidence that the classifier has on the target instance. experimental results with c4.5 decision tree learner as the base learning algorithm have shown that this algorithm has significantly outperformed both the base algorithm and the adaboost.m1 of the c4.5 decision trees with simple predictions.
from exponential to almost linear decomposability of finite or infinite trees. first-order constraints are first-order formulas built on a set of function and relation symbols using the following logical symbols: =, true, false, &not;, &and;, &or;, &rarr;, &harr;, &forall;, &exist;, (,). over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling, resource allocation, configuration, temporal and spatial reasoning, computer graphics, bio-informatics. while theory of finite or infinite trees t has played a fundamental role for both modeling and solving these problems, the complexity of solving first-order constraints with nested quantifiers and negations in t has been proved to be inherently huge (a tower of powers of two). however, a new property called decomposability has been recently introduced and used as a black-box to build many efficient first-order constraint solvers over t. we show in this paper that the algorithm which is used in this black-box (i.e. the algorithm which performs decomposability) has an exponential time and space complexity. we then present a much more efficient algorithm in the form of four rewriting rules which can perform the same decomposability in an almost-linear time and space complexity.
sink-oriented dynamic location service for shortest path relay with energy efficient global grid. portable wireless devices are increasing in popularity. mechanisms that allow information to be efficiently obtained through mobile wsns are of significant interest. however, a mobile sink introduces many challenges to data dissemination in large wsns. for example, it is important to efficiently identify the locations of mobile sinks and disseminate information from multi-source nodes to the multi-mobile sinks. in particular, a stationary dissemination path may no longer to effective in mobile sink applications, due to sink mobility. in this paper, we propose a sink-oriented dynamic location service (sdls) approach to handle sink mobility. in sdls, we propose an eight-direction anchor (eda) system that acts as a location service server. eda prevents intensive energy consumption at the border sensor nodes and thus provides energy balancing to all the sensor nodes. then we propose a location-based shortest relay (lsr) that efficiently forwards (or relays) data from a source node to a sink with minimal delay path. our results demonstrate that sdls not only provides an efficient and scalable location service, but also reduces the average data communication overhead in scenarios with multiple and moving sinks and sources.
load management in model-aware execution of composite web services. in the service oriented architecture services are computational units that can be published, discovered, consumed and aggregated in the platform and organization independent manner. the most widely accepted way to achieve service orientation (so) is with web services (wss), due to the standardization efforts and the wide range of available infrastructure. one of the most interesting aspects of wss is the ease with which they can be combined into composite web services (cwss). the most popular language to specify and implement cwss is bpel. while being easy to use, it also introduces difficulties to monitor and optimize cwss, specifically in the selection of optimal wss. this paper investigates the possibility to support this selection with dynamic load management, based on the alternative, model-aware, approach to orchestrate wss with the coloured petri nets (cpn) formalism. the use of the mathematically grounded formalism allows to model and verify properties of cwss and enables at runtime guidance of the execution of the cws. this paper presents how, during a model-aware execution of a cws, to predict and avoid some of the undesirable behaviors of wss. compared to bpel, the model-aware approach significantly improves the performance and manageability of cwss and thus opens up new deployment scenarios.
a recommendation system for browsing digital libraries. in this paper, a recommendation system for browsing large multimedia repositories is presented. in particular a combination of image processing algorithms and user behavior features is designed, implemented and tested. several experiments from a virtual museum scenario are carried out and discussed.
a lightweight 3d visualization and navigation system on handheld devices. this work presents a lightweight 3d visualization and navigation system we have proposed and implemented on handheld devices, using the open graphics library for embedded systems (opengl es api). the visibility algorithms view-frustum culling, backface culling (this one available in the opengl es api), and a combination of view-frustum culling and backface culling, associated to different depth levels of octrees (used to partition the 3d scene) were implemented and used to optimize the processing time required to render 3d graphics. the system was then tested using these combinations of algorithms and performance analyses were conducted for situations where the camera walks through an environment containing 6199 polygons. the results show that navigation at interactive rates of 10.07 and 30.61 frames per second can be obtained using the pock-etpc ipaq hx2490b and the mobile phone nokia n82, respectively.
a new k-view algorithm for texture image classification using rotation-invariant feature. this paper proposes a new k-view algorithm for texture image classification using rotation-invariant features. these features are statistically derived from characteristic view sets for each texture. unlike the existing k-view algorithm, all the views used are transformed into rotation-invariant features and the k views are selected randomly. in contrast, the existing k-view algorithm uses the k-means algorithm for choosing the k views. in this new algorithm the decision of determining a pixel to which texture class it belong to, is made by considering all the views which consist of the pixel being classified. in order to preserve the primitive information of a texture class as much as possible, the proposed algorithm randomly selects k views of the view set from each sample sub-image as the characteristic view set. experimental results show that the proposed algorithm is more robust and accurate compared with the results of the existing k-view algorithm.
visual detection of novel terrain via two-class classification. remote sensing of terrain characteristics is an important component for autonomous operation of mobile robots in natural terrain. often this involves classification of terrain into one of a set of a priori known terrain classes. situations can frequently arise, however, where an autonomous robot encounters a terrain class that does not belong to one of these known classes. this paper proposes an approach for visual detection of novel terrain based on a two-class support vector machine (svm) for situations when known terrain classes can be confidently associated with only a subset of the training data. experimental results from a four-wheeled mobile robot in mars analog terrain demonstrate the effectiveness of this approach.
cps-sim: configurable and accurate clock precision solid state drive simulator. nand flash memory is the most widely used storage medium in embedded systems today due to its many advantages such as light weight, low power consumption, and shock resistance. recently, solid state drives (ssds), which use nand flash memory to store data, are replacing conventional magnetic disks in laptops and some server computers. in the ssds, to achieve both high performance and large capacity, a number of flash memory chips are connected to multiple buses and ssd firmware exploits parallel accesses by using interleaving and overlapping techniques. however, it is still unclear how many buses or chips should be used and how to drive those chips and buses to satisfy performance that may be required. to help answer these questions, we have developed a clock precision ssd simulator (cps-sim) that simulates the internal behavior of an ssd and that reports timing and utilization information. from the accurate timing and utilization results of cps-sim, we can discover the optimal hardware configuration including the number of buses and chips and their interconnections in an ssd. also, it allows for fast development and verification of ssd firmware that runs an ftl (flash translation layer) optimized for an ssd. unlike ftls for embedded flash memory, the ftl for an ssd must utilize the concurrency of the multiple chips and buses. by supporting concurrency, our cps-sim provides a flexible environment for design of ssd firmware that drives the multiple flash memory chips and also that schedules data transmissions via the multiple buses.
visualization of clustered directed acyclic graphs with node interleaving. graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. an important subset of graphs is directed acyclic graphs (dags). e-spring algorithm, extended from the popular spring embedder model, eliminates node overlaps in clustered dags by modeling nodes as charged particles whose repulsion is controlled by edges modeled as springs. the drawing process needs to reach a stable state when the average distances of separation between nodes are near optimal. this paper presents an enhancement to e-spring to introduce a stopping condition, which reduces equilibrium distances between nodes and therefore results in a significantly reduced area for dag visualization. it imposes an upper bound on the repulsive forces between nodes based on graph geometry. the algorithm employs node interleaving to eliminate any residual node overlaps. these new techniques have been validated by visualizing ebay buyer-seller relationships and resulted in overall area reductions in the range of 45% to 79%.
daily demand forecasting of new products utilizing diffusion models and genetic algorithms. new high technology consumer products are released frequently. the manufacturers have to avoid dead stock because the value of the products drops sharply after the launch of new products. thus, the importance of daily demand forecasting is increasing. in this paper, we propose a daily demand forecasting method for new products. the method uses diffusion models to forecast demand. a genetic algorithm (ga) is used to estimate the parameters of the model. in order to apply the diffusion model to daily demand forecast, we introduce time-variant parameters, which depend on the day of the week. the proposed method is applied to the daily demand forecasting of high technology consumer products. the result shows that the proposed method has an excellent daily demand forecasting ability.
where are your manners?: sharing best community practices in the web 2.0. the web 2.0 fosters the creation of communities by offering users a wide array of social software tools. while the success of these tools is based on their ability to support different interaction patterns among users by imposing as few limitations as possible, the communities they support are not free of rules (just think about the posting rules in a community forum or the editing rules in a thematic wiki). in this paper we propose a framework for the sharing of best community practices in the form of a (potentially rule-based) annotation layer that can be integrated with existing web 2.0 community tools (with specific focus on wikis). this solution is characterized by minimal intrusiveness and plays nicely within the open spirit of the web 2.0 by providing users with behavioral hints rather than by enforcing the strict adherence to a set of rules.
extending bayesian trust models regarding context-dependence and user friendly representation. successful collaboration between independent entities depends on the selection of trustworthy interaction partners. bayesian trust models provide a well-founded way for deriving trust from evidence. yet, current approaches lack an integration of context-dependent parameters and a graphical representation for users. we propose a modification of the bayesian approach that integrates context-dependent parameters in the prior knowledge and that allows to overcome the negative effects that are usually introduced with aging. furthermore, we propose a mapping of this approach to a more intuitive representation of trust.
automated device for determination of skin lesion regions. the elliptical excision is a basic cutaneous surgery commonly performed by physicians and that consists of drawing a spindle shape with pointed ends having a length-to-width ratio 3--4: 1 with 30&deg; angles at each of the poles to avoid the dog-ear formation upon sew up. physicians who perform such excisional procedures tend to estimate and visually mark the border of the cut making such a procedure inaccurate, thus resulting in either excessive or less cutting of the skin. we propose an automated device that provides a rapid and precise determination of the borders of the excision. in order to perform the required function, the device obtains a snapshot of the lesion, determines its area using image processing, computes the required area to be removed, and finally projects a light accordingly representing the desired elliptic shape. the device consists of three main subsystems: a camera, a processing module and a light system. the paper presents the detailed implementation of the device and the performance results.
parallel materialization of large aboxes. this paper is concerned with the efficient computation of materialization in a knowledge base with a large abox. we present a framework for performing this task on a shared-nothing parallel machine. the framework partitions tbox and abox axioms using a min-min strategy. it utilizes an existing system, like swiftowlim, to perform local inference computations and coordinates exchange of relevant information between processors. our approach is able to exploit parallelism in the axioms of the tbox to achieve speedup in a cluster. however, this approach is limited by the complexity of the tbox. we present an experimental evaluation of the framework using datasets from the lehigh university benchmark (lubm).
building an efficient preference xml query processor. today user-centered information acquisition over collections of complex xml documents is increasingly in demand. to this end, preferences have become an important paradigm enabling users to express individual interests and delivering personalized information. as the structure of xml documents plays a major part in retrieval, users often have specific preferences about the structure. for evaluation a query has to be unfolded into an entire set of queries filling the structure with more or less preferred values. since such structure expansions typically contain redundancies, it is important to identify and simplify necessary expansion queries for effective evaluation. to address these issues, we developed a preference query optimizer that not only determines an optimal set of expansion queries, but also preserves the specific ordering induced by the user preferences with respect to pareto optimality.
executing jml specifications of java card applications: a case study. executability provides an important mechanism for validating formal specifications and allows such specifications to serve as prototypes and test oracles. in this case study, we used the jmle tool to execute the jml specification of an electronic purse application written in the java card dialect of java. this effort resulted in numerous improvements to the specification and to the jmle tool itself, as well as insight into how executability can contribute to the use of formal methods in the software development process.
modular implementation of adaptive decisions in stochastic simulations. we present a modular approach to implement adaptive decisions with existing scientific codes. using a sophisticated system software tool based on the function call interception technique, an external code module is transparently combined with the given program without altering the original code structure, resulting in a newly composed application with extended behavior. this is useful for generalizing codes into using different parameter values or to switch algorithms or implementations at runtime. applying the proposed method on a biochemical stochastic simulation software package to implement a set of exemplary use cases, which includes changing program parameters, substituting random number generators, and dynamically changing the stochastic simulation method, we demonstrate how effectively new code modules can be plugged in to construct an application with enhanced capabilities.
troll, a language for specifying dice-rolls. dice are used in many games, and often in fairly complex ways that make it difficult to unambiguously describe the dice-roll mechanism in plain language. many role-playing games, such as dungeons & dragons, use a formalised notation for some instances of dice-rolls. this notation, once explained, make dice-roll descriptions concise and unambiguous. furthermore, the notation has been used in automated tools for pseudo-random dice-rolling (typically used when playing over the internet). this notation is, however, fairly limited in the types of dice-rolls it can describe, so most games still use natural language to describe rolls. even dungeons & dragons use formal notation only for some of the dice-roll methods used in the game. hence, a more complete notation is in this paper proposed, and a tool for pseudo-random rolls and (nearly) exact probability calculations is described. the notation is called "troll", combining the initial of the danish word for dice ("terninger") with the english word "roll". it is a development of the language roll described in an earlier paper. the present paper describes the most important features of troll and its implementation.
design and implementation on a pie menu interface for analog joysticks. there have been recently several input methods that combine pen-based input with a pie menu as an input interface in environments where working space is limited. however, they suffer from various problems in that input operation is difficult to learn where there are many items on the menu. in this research, we propose a new space-saving input interface that combines an analog joystick and a hierarchical pie menu. the proposed method employs a hierarchical pie menu to enhance the number of items, and a frequency-based area division algorithm that works to expand the area for important items. using our method, an intuitive input interface is achieved that is high speed and highly accurate.
modeling and integrating aspects with uml activity diagrams. dealing with crosscutting concerns has been a critical problem in software development processes. aspect-oriented programming (aop) provides a viable programming-level solution by separating crosscutting concerns from primary concerns. to facilitate handling crosscutting concerns at earlier software development phases, this paper proposes an aspect-oriented modeling and integration approach at the design level. in our approach, primary concerns are depicted with uml activity diagrams as primary models, whereas crosscutting concerns are described with aspectual extended activity diagrams as aspect models. each aspect model consists of pairs of pointcut and advice model. aspect models can be integrated into primary models automatically. to this end, a prototype tool called jasmine-aoi has been implemented as an eclipse plug-in. with the tool support, we have conducted two case studies, including 15 primary models and 8 aspect models. the case studies demonstrate that our approach can greatly facilitate reasoning about crosscutting concerns when a system is modeled with activity diagrams.
real-time scheduling for continuous queries with deadlines. many stream-based applications have real-time performance requirements for continuous queries over time-varying data streams. in order to address this challenge, a real-time continuous query model is presented to handle multiple queries with timing constraints. in this model, the execution of one tuple passing through an operator path is modeled as a real-time task instance. a fine-grained scheduling strategy named op-edf is proposed for real-time scheduling, which schedules the operator path with the earliest deadline of the waiting tuples at any time slot. the experimental results show that the proposed continuous query model and scheduling algorithm are effective in real-time query processing for data streams with bursty arrival rates.