waashk/dblp huggingface dataset:
special track on geometric constraints and reasoning: editorial message. geometric computing and reasoning (gcr) aims at emphasizing recent trends in the domain of geometric constraint solving and automated, or computer aided deduction in geometry. this year sees the third edition of this technical track of sac.
special track on computer applications in health care: editorial message. in the last few years we have observed the evolution and a growing interest in the application of computer systems in the health care area, opening new possibilities of visualization of medical images, manipulation of medical data, interaction and communication among professional and patients, besides new ways for training and updating professional's knowledge.
special track on mobile computing and applications: editorial message. riding on the success of the previous mobile computing and applications track in 2003 to 2007, we are delighted to present the 2008 mobile computing and applications track that features research papers drawn from a highly diversified spectrum of mobile computing. we have been receiving an increasing number of submissions, hitting again a record high. the papers collected in this track cover three different and yet complementary areas: mobile applications that are supported by virtue of appropriate architectures and protocols, operating under specific mobile networks and devices. in particular, special attention was dedicated to draw upon research efforts and expertise from different areas of research, so as to promote better synergy and to bring forth not only core mobile communications and networking protocols for application development, but also important research applications to realize the benefits of anywhere, any place and anytime pervasive and ubiquitous computing.
collaborative software engineering on large-scale models: requirements and experience in modelbus. this work presents an approach for realizing model-driven software engineering in the distributed and multi-developers context. it particularly focuses on the scalability problems in a complex software project involving a large set of inter-connected models: (1) how to manipulate large data volume with limited computing resources, and (2) how to maintain consistency of inter-model links in a large model set, facing to concurrent model updates. as a solution, we propose the scalable copy-modify-merge mechanism, which allows each developer to copy only a model subset from the entire model set, to manipulate this subset locally, and to merge it back to the repository. this mechanism ensures the global consistency of the model set, particularly against dangling links. our approach is generic: it is applicable to all model types (uml and domain-specific models). also, it offers interoperability with existing, heterogeneous case tools. its prototype implementation in the modelbus environment is now available on the eclipse project "mddi".
a c++ environment for dynamic unanticipated software evolution. in this paper, we introduce a c++ environment for dynamic unanticipated software evolution. such an environment is composed of a c++ framework called ccf and a c++ application server called ccas. ccf is a framework for developing component based software supporting dynamic unanticipated evolution. such a framework implements the compor component model specification, which provides mechanisms to evolve applications at runtime, even for unpredicted changes. ccas manages the applications implemented through the ccf. we describe the ccf and ccas design and main implementation issues. in order to validate the proposed environment, we implemented an application for a linux based mobile device that encodes/decodes files using the djvu format.
a decision model for implementing product lines variabilities. software product lines (spls) encompass a family of software systems developed from reusable assets. one issue during spl development is the decision about which technique should be used to implement variabilities and improve the separation of concerns (soc) of the spl. in this paper, we present an initial decision model based on both qualitative and quantitative analysis to guide developers on choosing suitable techniques for implementing spl variabilities.
a lifecycle approach to soa governance. due to the distributed nature of service-oriented architectures (soa), maintaining control in a soa environment becomes more difficult as services spread over different lines-of-business. the concept of soa governance has emerged as a way to implement control mechanisms in a soa. in this paper we identify a lifecycle based approach for executing soa governance. this approach consists of defining a soa strategy, aligning the organization, managing the service portfolio, controlling the service lifecycle, enforcing policies and managing service levels. by incorporating a maturity model in this approach, it is possible to minimize the required effort while still having sufficient governance. from a series of interviews that have been carried out we could conclude that most current soa projects - although relatively limited in their scope - raise governance issues that need to be addressed to prevent future problems.
deciding what to observe next: adaptive variable selection for regression in multivariate data streams. variable selection can be valuable in the analysis of streaming data with costly measurements, as in intensive care monitoring or battery-powered sensor networks. in the presence of drift, selections must be constantly revised, calling for adaptive variable selection schemes. an important and novel problem arises from the fact that non-selected variables become missing variables, which induces bias upon subsequent decisions. here, we consider adaptive variable selection in the context of linear regression, using only a fraction of the available regressors per timepoint. we suggest a scheme that fits a multivariate gaussian over a sliding window using the em algorithm and selects which variables to observe next using the lasso algorithm. we experiment with simulated and real data to demonstrate that very high prediction accuracy may be retained using as little as 10% of the data.
designing ic structures by variety engineering. value creation increasingly relies on the bundling of physical products and services from different providers in networks such as supply chains. the complexity that arises from this cooperation is of utmost importance for management since the provision of an undisturbed flow of information affects the performance of the whole network. in this paper we develop a method for the analysis and design of information and communication structures. building on the design science research framework and using an exemplary case, we show how coordination complexity can be analyzed and measured. the results are combined with theoretical concepts from management cybernetics and create the foundation for the constructed method.
workflow management versus case handling: results from a controlled software experiment. business process management (bpm) technology has become an important instrument for improving process performance. when considering its use, however, enterprises typically have to rely on vendor promises or qualitative reports. what is still missing and what is also demanded by it decision makers are quantitative evaluations based on empirical and experimental research. this paper picks up this demand and illustrates how experimental research can be applied in the bpm field. the conducted experiment compares efforts for implementing a sample business process either based on standard workflow technology or on a case handling system. we motivate and describe the experiment design, discuss threats for the validity of experiment results (as well as risk mitigations), and present experiment results. in general, more experimental research is needed in order to obtain more valid data on the various aspects and effects of bpm technology and tools.
cprm: a chronic patient's management model based on the concepts of customer's relationship. this paper presents a chronic patient follow-up and attendance model based on the concepts of customers' relationship used in companies, mainly those available in crm technology (customer relationship management). the model was designated as chronic patient's relationship management (cprm). the cprm model, by using the crm concept on patient attendance, presents a strategy to follow-up and monitoring the chronic patient different from the usual traditional medical approach, which many times consists only in illness treatment. in the same way as the crm, this model is able to reach clients of every condition through its communication channels; and suggests the use of the same technology in order to guarantee an effective and suitable follow-up for all social layers. to implement the cprm model, the creation of relationship centers for chronic patients, thus building the model's infrastructure when properly connecting the information exchange, campaigns, and data processing and transmitting, for the purpose of improving the relationship with the patient through telephone and computing technology.
sensor stream reduction for clustered wireless sensor networks. this work presents the use of sensor stream reduction algorithms in clustered wireless sensor networks (wsns), where the cluster head node is responsible to reduce the amount of data generated by the nodes in its cluster. moreover, a formal description to sensor stream reduction problem is proposed and an analytical model is adapted to show that when our solutions are adopted in cluster based organization, they have a superior performance to that observed when they are used in a non-clustered organization.
a novel modeling language for tool-based business process engineering. business processes modeled with performance nets can be simulated, and therefore verified on their effectiveness and efficiency, before their implementation. modules and basic functions of a performance net-based software prototype called performancesimulator2010, designed to support the complete life cycle of performance indicator-based business process engineering are briefly presented.
parametric cepstral analysis for pathological voice assessment. traditional methods to diagnose laryngeal pathologies such as laryngoscopy are considered invasive and uncomfortable. methods based on acoustic analisys of speech signals have been investigated in order to diminish the number of laryngoscopical exams. digital signal processing techniques have been used to perform an acoustic analysis for vocal quality assessment due to the simplicity and the non-invasive nature of the measurement procedures. their employment is of special interest, as they can provide an objective diagnosis of pathological voices, and may be used as complementary tool in laryngoscopy. the degree of reliability and effectiveness of discriminating process of pathological voices from normal ones depends on the characteristics and parameters of voice used to train the employed classifier. this paper aims at evaluating the performance of the linear prediction coding (lpc)-based cepstral analysis to discriminate pathological voices of speakers affected by vocal fold edema. for this purpose, lpc, cepstral, weighted cepstral, delta cepstral weighted delta cepstral mel-cepstral coefficients and are used. a vector-quantizing-trained distance classifier is used in the discrimination process.
orthosearch: a scientific workflow approach to detect distant homologies on protozoans. managing bioinformatics experiments is challenging due to the orchestration and interoperation of tools with semantics. an effective approach for managing those experiments is through workflow management systems (wfms). we present several wfms features for supporting genome homology workflows and discuss relevant issues for typical genomic experiments. in our evaluation we used orthosearch, a real genomic pipeline originally defined as a perl script. we modeled it as a scientific workflow and implemented it on kepler wfms. we show a case study detecting distant homologies on trypanomatids metabolic pathways. our results reinforce the benefits of wfms over script languages and point out challenges to wfms in distributed environments.
on delegation and workflow execution models. workflow systems have long been of interest to computer science researchers due to their practical relevance. supporting delegation mechanisms in workflow systems is receiving increasing research interest. in this paper, we conduct a comprehensive study of user delegation operations in computerized workflow systems. in a workflow system, the semantics of a delegation operation are largely based on three factors: the underlying workflow execution model, task type and delegation type. we describe three different workflow execution models and examine the effect of various delegation operations in each workflow execution model. we then extend our workflow execution models to examine the effect of various delegation operations in different role-based workflow execution models.
stacked dependency networks for layout document structuring. we address the problems of structuring and annotation of layout-oriented documents. we model the annotation problems as the collective classification on graph-like structures with typed instances and links that capture the domain-specific knowledge. we use the relational dependency networks (rdns) for the collective inference on the multi-typed graphs. we then describe a variant of rdns where a stacked approximation replaces the gibbs sampling in order to accelerate the inference. we report results of evaluation tests for both the gibbs sampling and stacking inference on two document structuring examples.
perspective rectification of camera-based document images using local linear structure. this paper addresses the problem of perspective distortion rectification of camera-based document images. a perspective rectification method using local linear structure is proposed. in this work, only local structure information such as characters, text lines, and strokes are involved in perspective parallel line detection. horizontal lines are detected from the baselines of words or text lines, and vertical lines are detected from vertical strokes. an iterative method is used to locate vanishing points from perspective line bundles. finally, the perspective image is rectified by a quadrilateral-rectangle pair constructed by horizontal and vertical vanishing point. not using global information such as document boundary, paragraph format, this method has good generalization and is able to rectify partial documents or sparse documents.
g: a graph-based technique for resolving ambiguity in query translation candidates. in the field of cross-language information retrieval (clir), the resolution of lexical ambiguity is a key challenge. common mechanisms for the translation of query terms from one language to another typically produce a set of possible translation candidates, rather than some authoritative result. correctly reducing a list of possible candidates down to a single translation is an enduring problem. thus far, solutions have concentrated upon the use of the use of term co-occurrence information to guide the process of resolving translation-based ambiguity. in this paper we introduce a new disambiguation strategy which employs a graph-based analysis of generated co-occurrence data to determine the most appropriate translation for a given term.
ubicomp secretary: a web service based ubiquitous computing application. due to the extensive availability of wireless internet connectivity and low cost light weight mobile devices, an omnipresent customizable service is not a vision anymore. if this type of service can be made a reality, it can be used by different types of users in different fields such as education, tourism, shopping or business, at any time and at any place. in this paper, we present the details of ubicomp secretary (us), which is designed and developed to accomplish the above objectives. us is developed upon the web services based architecture which asserts its adherence to all the required features of an ubiquitous computing application. its evaluation by different means establishes these facts as well as its wide range of acceptability.
using ambiguity measure feature selection algorithm for support vector machine classifier. with the ever-increasing number of documents on the web, digital libraries, news sources, etc., the need of a text classifier that can classify massive amount of data is becoming more critical and difficult. the major problem in text classification is the high dimensionality of feature space. the support vector machine (svm) classifier is shown to perform consistently better than other text classification algorithms. however, the time taken for training a svm model is more than other algorithms. we explore the use of the ambiguity measure (am) feature selection method that uses only the most unambiguous keywords to predict the category of a document. our analysis shows that am reduces the training time by more than 50% than the scenario when no feature selection is used, while maintaining the accuracy of the text classifier equivalent to or better than using the whole feature set. we empirically show the effectiveness of our approach in outperforming seven different feature selection methods using two standard benchmark datasets.
entity ranking in wikipedia. the traditional entity extraction problem lies in the ability of extracting named entities from plain text using natural language processing techniques and intensive training from large document collections. examples of named entities include organisations, people, locations, or dates. there are many research activities involving named entities; we are interested in entity ranking in the field of information retrieval. in this paper, we describe our approach to identifying and ranking entities from the inex wikipedia document collection. wikipedia offers a number of interesting features for entity identification and ranking that we first introduce. we then describe the principles and the architecture of our entity ranking system, and introduce our methodology for evaluation. our preliminary results show that the use of categories and the link structure of wikipedia, together with entity examples, can significantly improve retrieval effectiveness.
model-driven development of component-based adaptive distributed applications. this paper introduces an approach to develop component-based adaptive distributed applications. our approach separates the communication and the functional aspects of a distributed application and specifies the communication part as an abstract distributed component called the communication component. we then introduce a model-based process for automatically building many evolutionary variants of this component at deployment level, and integrating these variants into the target adaptive application that can dynamically select the running variant in order to adapt to the changing context. thanks to an adaptation guide generated by the process, the adaptive application can coordinate distributed adaptations to (1) consistently transfer data of the replaced variant to the new one and (2) maintain the architectural coherence between distributed parts of the application. hence, the target adaptive application can correctly adapt at runtime without loss of data. in this paper, we present the principle of our approach, illustrate it with an example, and show how we have automated the development process by model transformations.
history offset implementation scheme for large scale multidimensional data sets. a novel implementation scheme for large scale multidimensional datasets is proposed and evaluated. the scheme implements a multidimensional dataset by employing multidimensional arrays. using multidimensional arrays provides many advantages, but suffers from some problems. the proposed history offset implementation scheme solves these problems by an efficient scheme of record encoding based on the notion of extendible array. in this paper, some solutions are presented against an essential problem of address space overflow in handling large scale multidimensional datasets. our proposed schemes will be proved to exhibit good performance in space and time costs.
special track on ubiquitous computing: ubiquitous and pervasive ecommerce and ebusiness: editorial message. ubiquitous computing has emerged as one of the principal information and communication technologies that could lead to the achievement of the ambient intelligence (ami) vision. ambient intelligence places human beings at the centre of the future knowledge-based society and implies a seamless environment of computing, advanced networking technology and unobtrusive interfaces: interaction should be relaxing and enjoyable for people. in an ami environment, humans will be surrounded by intelligent interfaces supported by computing and networking technology that is embedded in everyday objects such as furniture, clothes, vehicles, roads and smart materials - even particles of decorative substances like paint. the ami world then, is a world largely defined by ubiquitous computing applications, which are designed and developed to operate at the background, to disappear in the different layers of the physical world, in order to serve the needs of people unobtrusively.
a hybrid real-time component model for reconfigurable embedded systems. increasing capabilities of modern microcontrollers greatly increase their applicability to more and more unstable and complex environments. dynamic reconfiguration provides a powerful mechanism to adapt in such environments. however, the implementation of dynamic reconfiguration is still challenging for embedded real-time control software systems. in this paper, we present our real-time component framework which simultaneously supports hard real-time control and non-real-time adaption management while keeping the implementation as lean as possible. our contribution is the hybrid component model in which one part is designed to support the real-time task while its non-real-time counterpart deals with component adaptation and management functions. a detailed analysis of the intra-component management interface was provided. xml was employed to describe and configure real-time task. we also designed an interface between real-time objects to achieve an inter-real-time task communication scheme based on global shared memory. in the non real-time domain, by mapping much of the management functions to the osgi system service, we realized the components management service. our framework can achieve complex component management while providing hard real-time assurance.