waashk/dblp huggingface dataset:
person identification from heavily occluded face images. in numerous occasions there is need to identify subjects shown in heavily occluded face images. typical examples include the recognition of criminals whose facial images are captured by surveillance cameras. in such cases a significant part of the subjects face is occluded making the process of identification extremely difficult, both for automatic face recognition systems and human observers. in this paper we propose a face recognition algorithm, which can be used for identifying individuals with hidden facial parts. during the face recognition procedure, occluded facial regions are detected so that the model-based face recognition algorithm implemented makes use of information only from the non-occluded facial regions. with our approach information from occluded facial regions is not utilized during the process of face recognition hence the occlusions do not destruct the recognition process and as a result the probability of achieving correct identification is improved.
applying information visualization techniques to capture and explore the course of cognitive behavioral therapy. tracking and especially comparing psychotherapeutic processes is a complex task involving a large number of individual and complexly related parameters. therefore, descriptive and classical statistical methods are only suited for partial analyses. to overcome these limitations we introduce linkvis, a new information visualization (infovis) tool used to visualize and evaluate psychotherapeutic processes. linkvis is developed and clinically tested on the basis of cognitive behavioral therapy treating anorectic girls. the user gets new insight into the data under investigation due to the combination of three different visualization techniques: scatterplots, chernoff faces, and parallel coordinates. linkvis supports exploring of complex time-dependent data in order to gain more information about the psychotherapeutic process, especially when comparing different patients and groups.
building the functional performance model of a processor. in this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. the procedure tries to minimize the experimental time used for building the speed function approximation. we demonstrate the efficiency of our procedure by performing experiments with a matrix multiplication application and a cholesky factorization application that use memory hierarchy efficiently and a matrix multiplication application that uses memory hierarchy inefficiently on a local network of heterogeneous computers.
a multi-agent approach for solving optimization problems involving expensive resources. in this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserably. more specifically, we study the class of bin-packing problems. under our proposed fine-grained agent system scheme, rational agents work both collaboratively and selfishly based on local search and mimic physics-motivated systems. we apply our approach to a generalization of bin-packing - the inventory routing problem with time windows - which is an important logistics problem, and demonstrate the efficiency and effectiveness of our approach.
personalizing information gathering for mobile database clients. mobile agents are ideal for mobile computing environments because of their ability to support asynchronous communication and flexible query processing since tasks can be delegated to mobile agents when a mobile client is disconnected. this paper explores the use of mobile agents in personalizing information gathering for mobile database clients. personalized data take the form of materialized views and personalization is provided in the form of view maintenance options. these options, expressed using an extended sql create view command, offer a finer grain of control and balance between data availability and currency, the amount of wireless communication and the cost of maintaining consistency. the paper defines recomputational consistency and introduces new levels of materialized view consistency to better characterize the mobile client view currency customizations.
breaking value symmetries in matrix models using channeling constraints. multi-aspect assignment problems (maps) can be naturally formulated into various matrix models of constraint satisfaction problems (csps), which can contain both variable and value symmetries, using different viewpoints. while variable symmetry breaking constraints can be expressed relatively easily and executed efficiently by enforcing lexicographic ordering, value symmetry breaking constraints are difficult to formulate. we show when value symmetries in one viewpoint correspond to variable symmetries in another, and when symmetry breaking constraints in two viewpoints are consistent. our results allow tackling value symmetries efficiently using additional viewpoints and channeling constraints. experiments on the social golfer problem and a variant of the quasigroup existence problem confirm the benefits of our proposal against conventional methods.
investigating software measures to improve product reliability. inevitably, faults are introduced whilst software is being developed. if we can catch the faults before the system goes live we can improve the quality of the system and reduce the cost of maintaining the system. in this paper we have calculated software metrics from the testing and maintenance phases of the development of a software system. we are going to analyse this data and suggest some improvements that can be made to the software process to reduce the number of faults that are getting into the maintenance phase.
trasformers-by-example: pushing reuse in conceptual web application modelling. when defining a scheme of a web application, modelers repeatedly perform modelling tasks like "after having defined an entity type, add a page class for displaying the entity type's content". thereby, a scheme is extended again and again in a similar manner. it would therefore be convenient for modelers to have transformers that, when applied to a scheme, perform such tasks.in this paper, we present the language tbe (transformers-by-example) which allows defining transformers for webml schemes by example, i.e. by giving an example of what is desired instead of specifying operations for achieving the result. the notation of transformers is thereby similar to one with which modelers are familiar. further, each application of a transformer to a scheme can be parameterized such that the corresponding modelling task will be performed only within a specified part of the scheme. this makes it easy for modelers to define and apply transformers.
automated conversion from requirements documentation to an object-oriented formal specification language. in software engineering there have been very few attempts to automate the translation from a requirements document written in a natural language (nl) to one of the formal specification languages. one of the major reasons for this challenge comes from the ambiguity of the nl requirements documentation because nl depends heavily on context. we use contextual natural language processing (cnlp) to overcome the ambiguity in nl, and two-level grammar (tlg) to construct a bridge between a nl requirements specification and a formal specification in vdm++, an object-oriented extension of the vienna development method. the result is a system for mapping natural language requirements documents into an object-oriented formal specification language.
on optimal temporal locality of stencil codes. iterative solvers such as the jacobi and gauss-seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. the performance problems are largely due to cache misses, and can be reduced by tiling the codes. whereas previous research has shown the usefulness of tiling by experimentally comparing the run times of tiled and original codes, it did not tackle the question as to whether further improvements are possible. in this paper, we give a negative answer, regarding the exploitation of temporal locality in one step of a 2-dimensional stencil code. we derive upper and lower bounds that match up to a factor of about 1 + 2/m, where m is the cache size. for the upper bounds, we investigate some modifications of tiling.
geographical information access for non-structured data. this paper presents the virtual itineraries in pyrenees (piv) project. spatial and temporal unified models are proposed to give a formal representation to geographical information. the aim is to improve the access to local cultural and heritage document collections. the models take into account characteristics of heterogeneous human expression modes: written language and captures of drawings, maps, pictures, etc. semantic treatments have been built to automatically manage spatial and temporal information from non-structured data. these treatments are added to classical information extraction (ie) approaches. then, geographical information retrieval processing is based on geographical information systems (gis) algorithms. these algorithms look for any relations between formal representations of geographic information in documents collections and similar representations in a user query. finally we propose a prototype implementing such geographic ie and geographic information retrieval (ir).
a framework of individually-focused teleconferencing (ift) via an efficient 3d reprojection technique. in this paper, we propose a framework on individually-focused teleconferencing (ift) which is supported by an efficient 3d reprojection technique. the goal of designing ift is to provide sufficient 3d pose information to each teleconference participant in order to establish lively communication in a teleconference on low-bandwidth internet. a novel ift deployment and an efficient 3d reprojection technique are two major contributions of this paper. our 3d reprojection technique uses a mirror reference view in three-view epipolar geometry. it overcomes the inefficiency in previous techniques and provides visually good recovery of pose information of teleconference participants even though it is theoretically an approximation scheme.
identify amino acid candidates critical for function of rat imidase by cross-reference voting in imidase superfamily. it is a useful strategy to understand structure-function relationship of proteins by aligning and analyzing their sequences. database search techniques that can extract the functional or structural information from amino acid sequence are urgently needed. imidase superfamily provides an interesting case for developing such method. imidase super family contains a variety of related proteins that differ in functions and sequence identities. we developed a cross-reference voting algorithm with complexity o(nm2), where n is the number of total sequences and m is the maximum lenght of the sequence, to identify amino acid candidates that are critical for function of rat imidase. after analyzing more than 80 members of imidase superfamily, several amino acid residues of rat imidase are selected and examined. his67, his69, lys159, his192, his248 and asp326 of rat imidase are found corresponding to critical residues of hydantoinase studied by site-directed mutagenesis and structure information of hydantoinase. his67, his69, asp100, his217, his248, his420 and his459 of rat imidase are found corresponding to critical residues of dihydroorotase and allantoinase in separate studies. these results indicated that our algorithm could successfully extract functionally related amino acid candidates in imidase superfamily.
a concurrent reactive esterel processor based on multi-threading. esterel is a concurrent synchronous language for developing reactive systems. as an alternative to the classical software and hardware synthesis paths, the reactive processing approach uses a specialized processor with an instruction set tailored to esterel. a principal difficulty when compiling onto a reactive processor is the faithful, efficient implementation of concurrency. this paper presents a novel reactive processor architecture based on multi-threading, which allows the arbitrary nesting of preemption and concurrency, and is scalable to very high degrees of concurrency.
missing requirements and relationship discovery through proxy viewpoints model. this paper addresses the problem of "missing requirements" in software requirements specification (srs) expressed in natural language. due to rapid changes in technology and business frequently witnessed over time, the original srs documents often experience the problems of missing, not available, and hard-to-locate requirements. one of the flaws in earlier solutions to this problem has no consideration for missing requirements from multiple viewpoints. furthermore, since such srs documents represent an incomplete domain model, mannual discovery (identification and incorporation) of missing requirements and relationships is highly labor intensive and error-prone. consequently, deriving and improving an efficient adaptation of srs changes remain a complex problem. in this paper, we present a new methodology entitled "proxy viewpoints model-based requirements discovery (pvrd)". the pvrd methodology provides an integrated framework to construct proxy viewpoints model from legacy status requirements and supports requirements discovery process as well as efficient management.
efficient discovery of unique signatures on whole-genome est databases. expressed sequence tags (est) are widely used for the discovery of new genes, particularly those involved in human disease processes. a subsequence in an est dataset is unique if it appears only in one est sequence of the dataset but does not appear in any other est sequence. the unique subsequences can be regarded as signatures that distinguish an est from all the others, and provide valuable information for many applications, such as pcr primer designs and microarray experiments. the discoveries of unique signatures on large-scale est datasets are previously computational challenges. in this paper, we propose two efficient algorithms to extract the unique signatures from est databases. the algorithms perform impressive discovery efficiencies in the experiments on real human ests.
a seriate coverage filtration approach for homology search. the homology search within genomic databases is a fundamental and crucial work in biological knowledge discovery. with exponentially increasing size and access of databases, the issues of efficient retrieval become more essential in bioinformatics. due to the varieties of biological data, similar sequences are not only under some error tolerance, but are also above some seriate coverage level. in this paper, we propose a seriate coverage filtration approach to extract the homologies from the databases efficiently. our approach performs a lossless filtration and can be implemented as a preprocess of the existing search heuristics. our method converts a user's requests for error and seriate coverage levels to some thresholds of interest. accordingly, we transform the work of homology discovery to a variation of the longest increasing subsequence problem, and design an efficient counterpart algorithm. in the performance test, it is found that our approach has an attractive quality of filtration.
xvm: xml virtual machine. xml is an emerging standard for data representation and data exchange on the internet. xml-based web applications have been widely used in e-commerce and enterprise information management. in this paper, we propose an extensible, integrated xml processing architecture, the xml virtual machine (xvm). the xvm provides a framework for processing xml data, developing and deploying xml-based applications. by using a component-based technique, the xvm provides a high degree of modularity and reusability. xvm components are dynamically loaded and composed during xml data processing. new components can be easily added to existing applications and new applications can reuse existing components without difficulty. these features enable an xml application to keep up with requirements and schema evolution and to process compound documents. both client-side and server-side xml applications can be developed and deployed in an integrated way. also in this paper, we present an xml application container built on top of the xvm, along with several sample applications.
rearranging data objects for efficient and stable clustering. when a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. this problem is known as the order bias problem. to overcome this problem, the first clustering process proceeds to construct an initial partition. the partition is expected to imply the possible range in the number of final clusters. we apply center sorting to the data objects in the clusters of the partition to rearrange them in a new order. the same clustering procedure is reapplied to the newly arranged data set to build a new partition. we have developed an algorithm, reit, that achieves both efficiency and reliability. a number of experiments have been performed to show that the algorithm helps minimize the order bias effects.
local search with annealing-like restarts to solve the vehicle routing problem with time windows. in this paper, we propose a metaheuristic based on annealing-like restarts to diversify and intensify local searches for solving the vehicle routing problem with time windows (vrptw). using the solomon's benchmark instances for the problem, our method obtained 7 new best results and equaled 19 other best results. extensive comparisons indicate that our method is comparable to the best published literatures.
data sharing protocols for smt processors. although there are many real-time task synchronization protocols designed for uniprocessor and multiprocessor systems, most of them do not fit the needs in accommodating simultaneous multithreading (smt). real-time synchronization protocols are expected to bound the maximum number of priority inversions and to meet task deadlines. synchronization protocols for simultaneous processing need to explore the possibility in executing multiple tasks at the same time to increase the system concurrency level to utilize the abundant computing resources, of simultaneous multithreading computer systems. this work proposes the concept of "lp-time inheritance" to manage the period of blocking time without significantly decreasing the level of task parallelism. the schedulability tests for the proposed protocol are also presented.
distributed ipv6 addressing technique for mobile ad-hoc networks. connecting to the internet through the nodes of an ad-hoc network is very challenging and necessary. we studied a manet topology in which all nodes in this manet need to be connected to the internet through a special node called the internet gateway. traditional ipv6 duplicate address detection(dad) process cannot be applied for this topology without any modification. in this paper, we propose a stateful ipv6 auto-configuration scheme that can replace dhcpv6 for ad-hoc networks. our simulation shows that this scheme is lighter and faster than dhcpv6.
a hybrid ai approach for nurse rostering problem. this paper presents a hybrid ai approach for a class of overconstrained nurse rostering problems. our approach comes in two phases. the first phase solves a relaxed version of problem which only includes hard rules and part of nurses' requests for shifts. this involves using a forward checking algorithm with non-binary constraint propagation, variable ordering, random value ordering and compulsory backjumping. in the second phase, adjustments with descend local search and tabu search are applied to improved the solution. this is to satisfy the preference rules as far as possible. experiments show that our approach is able to solve this class of problems well.
evaluation of current architecture frameworks. with the growing importance of enterprise architecture the discussion about how to create or choose the right enterprise architecture framework for a specific organization arose quickly. but it is not only a question of choosing the right framework for describing or developing an enterprise architecture. it is more important to discover whether the chosen architecture framework meets the defined requirements or not. in this paper, we describe which requirements currently existing architecture frameworks should meet to constitute a useful procedure that enables to develop, describe and keep up an enterprise architecture. our evaluation of current frameworks shows their lacks and identifies further improvement.
implementing an embedded gpu language by combining translation and generation. dynamic languages typically allow programs to be written at a very high level of abstraction. but their dynamic nature makes it very hard to compile such languages, meaning that a price has to be paid in terms of performance. however under certain restricted conditions compilation is possible. in this paper we describe how a domain specific language for image processing in python can be compiled for execution on high speed graphics processing units. previous work on similar problems have used either translative or generative compilation methods, each of which has its limitations. we propose a strategy which combine these two methods thereby achieving the benefits of both.
a multi-agent algorithm for vehicle routing problem with time window. many existing algorithms for solving the vehicle routing problem with time windows (vrptw) first construct initial tours and then apply a tour optimization algorithm to refine the solution. in this two-stage approach, the tour optimization stage is often hampered by the tour construction phase that produce initial solutions that are skewed, namely, the initial tours are very good, but the later tours are often very poor. this often leads to difficulties in the tour-optimization stage that often get trapped in local optimal quickly. in this paper, we propose a new multi-agent algorithm for solving the vrptw that involves the uses a distributed, multi agent approach for the tour-optimization phase. our approach can be considered as a combination of multi-agent system and heuristic local search. a prototype system has been developed and extensive experimentation on the solomon benchmarks show that our multi-agent approach is effective and has comparable performance to the best results in the literature.
use of correctness assertions in declarative diagnosis. we use assertions to reduce the quantity of queries in declarative diagnosis of logic programs. we first present a declarative diagnoser for normal logic programs. given a bug symptom, the diagnoser first constructs a tree that models the execution of the bug symptom and then searches the tree for the bug that causes the bug symptom. we then incorporate into the diagnoser three tree transformations that prune the tree before it is searched. these transformations make use of two kinds of assertion about the correctness of the program and maintain the soundness and completeness of the diagnoser. these transformations reduce the size of the tree and thus reduce the quantity of queries imposed on the oracle.