waashk/dblp huggingface dataset:
prioritization of enterprise resource planning (erp) systems success measures: viewpoints of two organizational stakeholder groups. business organizations worldwide are adopting enterprise resource planning (erp) systems. a number of studies deliberate the adoption and implementation of erp, but few investigate the success of the system. to our knowledge, this is the first study of its kind to investigate the perspectives of key organizational stakeholders with respect to the success of their erp software. using postal surveys in finland and estonia, two small northern european countries, we obtained empirical data from 44 private organizations in diverse industries. our objective was to determine whether differences exist between two organizational stakeholder groups (top- and mid-level managers) concerning their prioritization and evaluation of measures relating to the success of their erp software. despite their distinct roles and influence, we did not notice any significant statistical differences between the two groups in this regard. however, each group evaluated measures such as "accuracy" and "reliability" differently. this paper discusses the implications of the study for both practice and research.
union types for object-oriented programming. we propose union types for statically typed class-based object-oriented languages as a means to enhance the flexibility of subtyping. as its name suggests, a union type can be considered a set union of instances of several types and behaves as their least common supertype. it also plays the role of an interface that 'factors out' commonality of given types---fields of the same name and methods with similar signatures. union types can be useful for implementing heterogeneous collections and for grouping independently developed classes with similar interfaces, which has been considered difficult in languages like java. to rigorously show the safety of union types, we formalize them on top of featherweight java and prove that the type system is sound.
retrieving lightly annotated images using image similarities. users' search needs are often represented by words and images are retrieved according to such textual queries. annotation words assigned to the stored images are most useful to connect queries to the images. however, due to annotation cost, quite limited amount of annotation words are available in many cases. when annotations are not given at all, there needs to be some techniques that assign annotations automatically. when only a few annotation words are given to each image (lightly annotated), there need to be some enhancement techniques that best use the available annotations. we address the later problem by estimating word associations to fill in the lexical gap between queries and annotations. the model of word associations can be learned from the data. however, since images are only lightly annotated, their sparseness in computing word associations becomes crucial. to compensate the sparseness, we propose a novel data exploration technique in which image similarities contribute to the estimation of word associations on the assumption that similar images have similar semantic concepts. we experimentally show the potential benefit of our approach.
a declarative framework for adaptable applications in heterogeneous environments. in this paper we present an approach for developing adaptable software applications. the problem we are facing is that of a (possibly mobile) user who wants to download and execute an application from a remote server. the user's hosting device can be of different kinds (laptops, personal digital assistants, cellular phones, communicators, etc.) with specific hardware and software capabilities. the problem is to be able to decide whether the user's current device characteristics are compatible with the application requirements in order to prevent execution failures. in the negative case we want to identify the reasons that determined the incompatibility and perform an automatic adaptation of the application, so that it can match the user's device capabilities. we adopt a declarative approach: we provide each device with a declarative description of its characteristics and, possibly, context constraints. inspired by proof carrying code (pcc), we use first-order logic formulae to model both the behavior of the code, with respect to the properties of interest, and the execution context. the adaptation process is carried out by using theorem proving techniques, in particular, the proof assistant hol4. the aim is to derive a formal proof which asserts that the behavior of the code can be correctly adapted to the given context. by construction, the proof, if it exists, gives information on how the adaptation has to be done. on the application side, java2 micro edition (j2me) is the chosen reference application development environment.
using xml and related standards to support location based services. location based services can be considered as the most rapidly expanding field of the mobile communications sector. the proliferation of the mobile/wireless internet, the constantly increasing use of handheld, mobile devices and positioning technologies and the emergence of mobile computing, prepared the grounds for the introduction of this new type of services with impressively large application domain and use range. the combination of position fixing mechanisms with location-dependent, georgraphical information, can offer truly customized personal communication services through the mobile phone or other type of devices. web services have emerged as a set of open standards and gained a lot of momentum during the recent past. many software vendors are announcing web service initiatives and adoption in their products. many organizations are involved in the refinement of web service standards. moreover, xml has become the de facto standard for data interchange on the web and its emergence is having an enormous impact on web development. motivated by the technology advances in the aforementioned areas in this paper we discuss the exploitation of web services and xml to build a generic platform for delivering location based services (lbs) to the nomadic user.
an adaptive index allocation scheme for reliable data retrieval and provision in peer-to-peer networks. file-sharing peer-to-peer systems are effective for autonomous data retrieval and provision over the networks. however, the previous data retrieval schemes such as gnutella and local indices have bad performance and large overhead. in order to solve these drawbacks, this paper proposes an adaptive scheme for data retrieval and provision, in which indices are dynamically allocated in appropriate nodes adaptively to variation of traffic patterns caused by query messages. the simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.
an integrated model of workflows, e-contracts and solution implementation. electronic-contracts (e-contracts) are structured models of business contracts. business transactions between enterprises can be supported by inter-workflows based on standards. however, exceptions, namely problematic situations whose solutions are not specified in the workflow design, are not well supported in the proposed models. such exceptions need to be resolved observing e-contracts. discussion and decision-making by participants are necessary for interpreting e-contracts and agreeing on a solution. in this paper, we propose workflow-contract-solution model (wcs model) to support such e-contract oriented execution of business processes.
data logistics as a means of integration in healthcare applications. information integration is still a crucial issue in healthcare applications. most clinical applications are determined by a huge variety of heterogeneous and independent work places, most of them equipped with specialized clinical hardware. due to this it is almost impossible -- at least not feasible -- to run a common database system storing all relevant data of a clinical application. nevertheless these clinical applications have to share their data. our solution to this integration problem is to facilitate so called process based data logistics. this approach is based on the integration capabilities of process management; however it does not coordinate the staff working in the healthcare domain in a restricting sense, but coordinates data sources and data sinks of these applications.
using the structure of documents to improve the discovery of unexpected information. in this paper we are interested in taking into account the structure of the documents during the discovery of unexpected information in textual databases. following a work that aimed at designing and integrating, in the unexpectedminer system, some measures for the evaluation of the unexpectedness of documents, we wanted to improve the system by taking into account the structure of the documents processed. each part of the documents are weighted by some coefficients whose values are determined by optimization techniques. those coefficients are then used by the system in the unexpectedness measures to determine if a document contains some unexpected information or not. the efficiency of our new system is then evaluated and the experiments put forward the improvements induced by the use of the structure of the documents.
adaptive and fault tolerant medical vest for life-critical medical monitoring. in recent years, exciting technological advances have been made in development of flexible electronics. these technologies offer the opportunity to weave computation, communication and storage into the fabric of the every clothing that we wear, therefore, creating intelligent fabric. this paper presents a medical vest which has sensors for physiological readings and software-controlled, electrically-actuated trans-dermal drug delivery elements. furthermore, computational elements are embedded in the vest for collecting data from sensors, processing them and driving actuation elements. since this vest will be used for medical, life-critical applications, the single most critical requirement of such a vest is an extremely high level of robustness and fault tolerance. meantime, the key technological constraint for these mobile systems is their power consumption. our target application for our medical vest is the detection of possibly fatal heart problems, specifically unstable angina pectoris or ischemia. we illustrate the design stages of our medical vest as well as the technical details of both software and network reconfiguration schemes (to enhance the robustness and the performance of our system). we also discuss the details of ischemia detection algorithm employed in our vest. moreover, we evaluate the robustness of our system with existence of various faults. finally we measure the performance of our algorithm as well the power consumption of several configurations of our vest.
efficient placement and routing in grid-based networks. this paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. our system requires an extremely high level of robustness and efficient power optimization techniques. by modeling the faults, we evaluate the probability of having failures in network. then we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. we develop efficient methodology to address these problems and perform both placement and routing simultaneously. this ensures that the solution is a lower bound for both problems. we evaluate the effectiveness of our proposed techniques on a variety of benchmarks.
modere: the model-checking engine of rebeca. rebeca is an actor-based language with formal semantics that can be used in modeling concurrent and distributed software and protocols. automatic verification of these systems in the design stage helps develop error free systems. in this paper, we describe the model checking tool developed for verification of rebeca models. this tool uses partial order reduction technique for reducing the size of the state space generated for a given model. using this tool for model checking rebeca yields much better results than the previous attempts for model checking rebeca.
a comparison on information fusion methods for air target identification. we compared the performance of bayes theory, fuzzy set theory, heuristic method and dempster-shafer theory in the identification of aircrafts by using the information from different sensors. from the results of the simulation, the fuzzy method produces the best result. the final identification could be improved if specific features of each type of aircraft are available. to get more accurate object identification, the results from each method can be combined with the best assignment of values for each method.
an agent design method promoting separation between computation and coordination. the development of (internet) agents is often a tedious and error-prone task resulting in poorly reusable designs, since both the internal computation of the agent as well as the coordination support are developed in an ad hoc fashion. to improve the process of agent-oriented software development, we propose an agent design method that imposes the separation of internal computation from coordination aspects. this method comprises two dimensions: a design formalism and an agent design process. as an illustration of the presented method, we present the design of an internet agent that is entitled to deploy a distributed service in a computer network, without breaking the consistency of that network. the presented design method has resulted in the development of acf (agent composition framework), a component framework to build flexible internet agents. we argue that the presented design method combined with this infrastructure can promote a modular and easy to manage approach to the design and development of internet agent applications.
object-oriented middleware for location-aware systems. location-based systems are often aiming at the separation of the concept of location to a particular system, or, alternatively, treat location as yet another issue that should be fit into a larger prescribed application framework. this may lead to increasingly complex system architectures, when application logic uses location only as a facility. as a solution that gathers the best sides of both approaches, we propose an approach where object-oriented middleware is used for handling location-based issues in applications that run in mobile devices. in this paper, we will introduce distribution of software and hardware components, as well as sketch the internal architecture of the middleware in terms of the most relevant interfaces. towards the end of the paper, a sample application is also introduced.
generating association graphs of non-cooccurring text objects using transitive methods. in this paper we discuss text data mining (tdm) mainly in the context of the biomedical domain, where we extract associations from medline text articles and construct association graphs. we explore two techniques, the co-occurrence method and transitive method. we propose a novel transitive method of finding associations that does not rely on meta-data, and compare the results with another known transitive method that uses metadata in text, to find a link/relationship between objects of interest. co-occurrence of these terms (objects) is not required in the transitive methods to find out that they are associated. the results show that our proposed new method is as accurate as the known method that uses meta-data. this, in turn, implies that relationships can be discovered even when meta-data is not available or incomplete. a case study of a transitive association between a pair of genes (brcai---stati) is also carried out to illustrate the effective hypothesis generating ability of our method. based on the results, we conclude that our method can be used effectively for association extraction and also for hypothesis generation, which can later be validated through biological experimental analysis.
l0 buffer energy optimization through scheduling and exploration. clustered l0 buffers are an interesting alternative to reduce energy consumption in the instruction memory hierarchy of embedded vliw processors. currently, the synthesis of l0 clusters is performed as a hardware optimization, where the compiler generates a schedule and based on the given schedule l0 clusters are generated. however, the cluster synthesis is sensitive to the given schedule. this offers an interesting design space to explore the effects on clustering by altering the schedule to increase energy efficiency. in this paper we present a preliminary study indicating the potentials offered by scheduling for l0 clusters in terms of l0 buffer energy reduction. a list scheduler is extended to recognize the l0 clusters and based on a few simple heuristics operations are assigned to clusters. an iterative methodology is employed to explore the design space. the simulation results indicate that up to 10% of l0 buffer energy can potentially be reduced by scheduling for l0 clusters with a simple heuristic.
performance evaluation for a compressed-vliw processor. this paper presents a new ilp processor architecture called compressed vliw (cvliw). the cvliw processor constructs a sequence of long instructions by removing nearly all nops (no operations) and lnops (long nops) from vliw code. the cvliw processor individually schedules each instruction within long instructions using functional unit and dynamic scheduler pairs. every dynamic scheduler in the cvliw processor individually checks for data dependencies and resource collisions while scheduling each instruction. in this paper, we simulate the architecture and show that the cvliw processor performs better than the vliw processor for a wide range of cache sizes and across various numerical benchmark applications. these performance gains of the cvliw processor result from individual instruction scheduling and size reduction of object code. even though we assume a cache with a zero miss rate, the cvliw's performance is still 9%~15% higher than that of the vliw processor regardless of benchmark applications.
cosar: commitment-oriented "sense and respond" system for microelectronic manufacturing. microelectronic manufacturing is a discipline of supply chain management, and deals with the efficient coordination of manufacturing processes and owning enterprise along a value chine to provide products to customers. the systems for microelectronic manufacturing processes are usually linear, rigid and producing solutions that are far from optimal. this paper presents a commitment-oriented "sense and respond" system, called cosar, for microelectronic manufacturing. cosar enables the development of adaptive and configurable manufacturing systems. we will explain both the concept of commitment and also the foundation and architecture of cosar.
gis, sinks, fill, and disappearing wetlands: unintended consequences in algorithm development and use. geographic information systems (gis) software has become an important computational tool in several fields. gis software ranges from command line processors, with maximal control over internal model decisions, to gui versions with point-and-click access to pre-set modules. based on the output from this software, some gis users make important decisions to plan and manage landscapes (e.g., cities, parks, forests) with real consequences for the managed ecosystems. we discuss a programming decision in a gis algorithm originally used to discern flow direction in hydrological modeling: a first step in mapping streams and rivers. topographic depressions ("sinks") are "filled" in the algorithm to map water flow downstream; otherwise, the gis algorithm cannot solve the flow direction. unfortunately, sinks are often "isolated" wetlands which provide essential habitat for many species not commonly found elsewhere. thus the algorithmic filling of sinks can make these wetlands "disappear" in gis output and land-use decisions based on this output.this algorithmic detail may have potentially devastating real-world consequences for numerous wetlands because land-use plans made in ignorance cannot adequately conserve these unique habitats and the vital ecosystem services that wetlands provide. these consequences were not anticipated by the programmers who originally implemented the flow direction algorithm and may not be known to gis users. we offer several strategies to reduce the impact of these consequences for gis programmers, users, and policy makers who depend on gis data when making decisions.
generating web-based systems from specifications. the amount of web-based systems is growing rapidly and the complexity of the developed systems is increasing as well, and in the literature one speaks about a web crises.many web-based systems have a structure where users via a browser can perform operations on a database. we show that major parts of the software of such applications can be generated and verified from specifications of the functional requirements and specifications of the navigation.in particular, we show how to generate a modular software architecture, which is type safe in the sense that it enforces that functions throughout the application are applied to arguments of the correct type, and navigation safe taking e.g. into account consistency among user groups, functions and reachable web pages, and type consistency of web pages wrt. to functions on links.a default implementation of the functional requirements is generated allowing e.g. the navigation to be validated at an early stage of the development.a full implementation is obtained from the generated software architecture by implementing the functional requirements only, and this is done using a strongly-typed language.
prototype system for method materialisation and maintenance in object-oriented databases. the efficient execution of a method has a great impact on a system response time. optimising access to data returned by methods is difficult as methods are written in high-level programming languages. moreover, estimating a method's execution cost is another serious problem because of the complexity of a method's code. a promising technique to tackle the problem of optimising execution of methods is based on method materialisation. within our project we developed, so called, hierarchical method materialisation technique. in this paper we present a prototype system for hierarchical materialisation of methods and for the management of their results in an object-oriented database.
adaptation point analysis for computation migration/checkpointing. finding the appropriate location of adaptation points for computation migration/checkpointing is critical since the distance between two consecutive adaptation points determines the migration/checkpointing scheme's sensitivity and overheads. this paper proposes a heuristic adaptation point placement algorithm to improve the computation migration/checkpointing schemes' performance in terms of sensitivity and flexibility. this heuristic algorithm enables automatic and transparent insertion of checkpoints in user's source code.
tough constraint-based frequent closed itemsets mining. mining frequent itemsets has been one of the hot topics in data mining. candidate generation-and-test approaches such as apriori have been proved to be effective. however, in practical applications, we will face a lot of intractable frequent itemsets under the preset minimum support. in order to solve the problem, we have two methods: constraint-based mining and frequent closed itemsets mining. to the best of our knowledge, it has not been studied how to combine one of the complex constraint, tough constraint, with the frequent closed itemsets mining. in this paper, we show the benefits of combining the two technologies through the tc-based fcm algorithm. we also discuss the following two problems: 1) which one should be put in advance, select process or filter process? 2) how to make full use of the information from the upper level.