ppxscal/embedding_network huggingface dataset:
OPT: organization and process together
Authors: Carolyn B. Seaman
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

The productivity of a software development effort and the quality of the resulting product are determined by the environment in which the software is created. A major driver of the effectiveness of a software production environment is the relationship between the development process and the organizational structure. The work described in this paper studies this relationship.Related work in the study of software development processes includes continuous process improvement, flexible development processes, lean development, and capability maturity. None of these have considered explicitly the importance of the underlying organizational structure to the effectiveness of the process and the quality of the product. However, the effect that an organizational structure can have on the process is of sufficient magnitude to justify considering these two elements together, as equal parts of a single system.This paper describes the OPT approach to improvement of software development environments through improvement of the organizational structure and process. The approach is an iterative improvement method. The steps include modeling the relationship between the organization and the process, measuring various properties of this relationship, and evaluating a set of goals and constraints.
The Zero-Free Intervals for Characteristic Polynomials of Matroids
Authors: Hugh Edwards, Robert Hierons, Bill Jackson
Venue: Combinatorics, Probability and Computing (1998)

Let M be a loopless matroid with rank r and c components. Let P(M, t) be the characteristic polynomial of M. We shall show that (&minus;1)rP(M, t)&ge;(1&minus;t)r for t&isin;(&minus;&infin;, 1), that the multiplicity of the zeros of P(M, t) at t=1 is equal to c, and that (&minus;1)r+cP(M, t)&ge;(t&minus;1)r for t&isin;(1, 32&#x002F;27]. Using a result of C. Thomassen we deduce that the maximal zero-free intervals for characteristic polynomials of loopless matroids are precisely (&minus;&infin;, 1) and (1, 32&#x002F;27].
Signal processing and recognition of true kinetic equations containing non-integer derivatives from raw dielectric data
Authors: R. R. Nigmatullin, S. I. Osokin
Venue: Signal Processing (2003)

Signal processing in dielectric spectroscopy implies that it is necessary to find a 'true' fitting function (having a certain physical meaning), which describes well the complex permittivity and impedance data. In dielectric spectroscopy for description of complex permittivity/impedance data researches usually use the empirical Cole-Davidson (CD) and Havriliak-Negami (HN) equations that contains one relaxation time. But the parameters figuring in CD and HN equations do not have clear physical meaning as well as fitting parameters entering into linear combination of several CD or HN equations. For description of dielectric (especially asymmetric) spectra we suggest the complex permittivity functions containing two or more characteristic relaxation times. These complex susceptibility functions correspond in time domain to new type of kinetic equation containing non-integer (fractional) integrals and derivatives. We suppose that these kinetic equations describe a wide class of dielectric relaxation phenomena taking place in heterogeneous substances. To support and justify this statement the special recognition procedure has been developed that helps to identify this new kinetic equation from raw dielectric data. It incorporates the ratio presentation (or RP) format and separation procedure. Separation procedure was turned out to be helpful in detection of number of relaxation processes (each process is described by a characteristic relaxation time) taking place in the dielectric material under consideration. We suppose that this procedure can be applicable also for identification of fractal noises.
Endomorphisms of Partially Ordered Sets
Authors: Dwight Duffus, Tomasz Łuczak, Vojtěch Rödl, Andrzej Ruciński
Venue: Combinatorics, Probability and Computing (1998)

It is shown that every partially ordered set with n elements admits an endomorphism with an image of a size at least n1&#x002F;7 but smaller than n. We also prove that there exists a partially ordered set with n elements such that each of its non-trivial endomorphisms has an image of size O((n log n)1&#x002F;3).
Enforcing cardinality constraints in the ER model with integrity methods
Authors: Mira Balaban, Peretz Shoval
Venue: Advanced topics in database research vol. 1 (2003)

Entity-Relationship (ER) schemas include cardinality constraints that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on application transactions, since insertions or deletions of entities or relationships might affect related entities. Application transactions can be strengthened to preserve the consistency of a database with respect to the cardinality constraints in a schema. Yet, once an ER schema is translated into a logical database schema, the direct correlation between the cardinality constraints and application transaction is lost, since the components of the ER schema might be decomposed among those of the logical database schema.We suggest extending the Enhanced-ER (EER) data model with integrity methods that can enforce the cardinality constraints. The integrity methods can be fully defined by the cardinality constraints, using a small number of primitive update methods, and are automatically created for a given EER diagram. A translation of an EER schema into a logical database schema can create integrity routines by translating the primitive update methods alone. These integrity routines may be implemented as database procedures, if a relational DBMS is utilized, or as class methods, if an object-oriented DBMS is utilized.
Abstract user interface representations: how well do they support universal access?
Authors: Shari Trewin, Gottfried Zimmermann, Gregg Vanderheiden
Venue: Proceedings of the 2003 conference on Universal usability (2003)

This paper examines four XML languages for abstract user interface representation: UIML, XIML, XForms and AIAP. It discusses whether the high level architectures of these languages support the requirements of universal usability by allowing use of personal interfaces. Specific technical requirements include separation of data from presentation, explicit declarative representation of interface elements, their state, dependencies, and semantics, flexibility in inclusion of alternative resources and support for remote control and different interaction styles. Of the languages examined, XForms and AIAP provide the best match to the requirements. While XForms requires an appropriate delivery context to provide full access, the AIAP standard will include specification of the context in which the language is to be used.
Adaptive Real-Time Publish-Subscribe Service Model for Mobile Communication Environments
Authors: Qiang Wang, Hong-an Wang, Heng Tang, Guo-zhong Dai
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

With the rapid advances in mobile computing technology, there is increasing demand for disseminating information to large numbers of clients with wireless network. The service model, which supports such mobile communication environments, should be scalable, flexible, and cater to the limited bandwidth of mobile clients while providing real-time guarantees. In this paper, we present high-level design of an adaptive real-time publish-subscribe model for mobile communication environments. To express the model and the underlying work mechanism, we define four primitives: publish, subscribe, activate and deactivate. Furthermore, we discuss how to achieve the adaptability and real-time property in the model. Primary simulation study shows that the service model is feasible and well suited to address the requirements of mobile computing. In conclusion, we identify some open problems and our future work.
Fault tolerant web service
Authors: Deron Liang, Chen-Liang Fang, Chyouhwa Chen, Fengyi Lin
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Zwass suggested that middleware and message serviceis one of the five fundamental technologies used torealize Electronic Commerce (EC) [26]. The SimpleObject Access Protocol (SOAP) is recognized as a morepromising middleware for EC applications among otherleading candidates such as CORBA. Many recent pollsreveal however that security and reliability issues aremajor concerns that discourage people from engaging inEC transactions. We notice that the fault-tolerance issueis somewhat neglected in the current standard, i.e.,SOAP 1.1 [23]. We therefore propose a fault tolerantweb service called fault-tolerant SOAP or FT-SOAPthrough which web services can be built with higherresilience to failure. FT-SOAP is based on our previousexperience with an object fault tolerant service (OFS)[10] and OMG's fault tolerant CORBA (FT-CORBA)[17]. There are many architectural differences betweenSOAP and CORBA. One of the major contributions ofthis work is to discuss the impact on FT-SOAP designdue to these architectural differences. Our experienceshows that web services built on a SOAP frameworkenjoy higher flexibility as opposed to those built onCORBA. We also point out the limitations of the currentfeature sets of SOAP 1.1. We believe our experience isvaluable not only to the fault-tolerance community, butalso to other communities as well, in particular, to thosewho are familiar with the CORBA platform.
Skinning 3D meshes
Authors: Alla Sheffer
Venue: Graphical Models (2003)

A planar parameterization of 3D surfaces is useful for many applications, The applicability of the parameterization depends on how well it preserves the surface geometry (angles, distances, and areas). For most surface meshes there is no parameterization which preserves the geometry exactly. The distortion usually increases with the rise in surface complexity. For highly complicated surfaces the distortion can become so strong as to make the parameterization unusable for application's purposes. A solution is to partition the surface or introduce cuts in a way which will reduce the distortion. This article presents a new method for cutting seams in 3D mesh surfaces. The addition of seams reduces the surface complexity and hence reduces the metric distortion produced by the parameterization. Seams often introduce additional constraints on the application for which the parameterization is used, hence their length should be minimal. The presented method minimizes the seam length while reducing the parameterization distortion to acceptable level.
Predicting operational behaviour of abstract programs during formal developments
Authors: Yamin AIT-AMEUR
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

Several formal approaches for the development of programs have been suggested. Among them, the transformational approach which allows to express formal developments as a linear equational proof. These developments lead to produce on the one hand the suited program satisfying its formal initial specifications and, on the other hand, the proof of correctness of this development. In most of the cases, this correctness is concerned with the only functional aspects. Operational ones are taken into account intuitively. Our paper deals with non functional correction of software. We suggest a transformational approach which allows the developer to produce cost expressions that can be interpreted in order to evaluate and get the benefit yielded by a given transformation application. These cost expressions are correctly associated to the intermediate objects of the development (abstract progrms). We present a classification of the properties which are studied during the development phase and the correct formal transformational process allowing to get a particular evaluator for each kind of non functional properties. Applications are given as well.
Automated location matching in movies
Authors: F. Schaffalitzky, A. Zisserman
Venue: Computer Vision and Image Understanding (2003)

We describe progress in matching shots which are images of the same 3D location in a film. The problem is hard because the camera viewpoint may change substantially between shots, with consequent changes in the imaged appearance of the scene due to foreshortening, scale changes, partial occlusion and lighting changes. We develop and compare two methods which achieve this task. In the first method we match key frames between shots using wide baseline matching techniques. The wide baseline method represents each frame by a set of viewpoint covariant local features. The local spatial support of the features means that segmentation of the frame (e.g., into foreground/background) is not required, and partial occlusion is tolerated. Matching proceeds through a series of stages starting with indexing based on a viewpoint invariant description of the features, then employing semi-local constraints (such as spatial consistency) and finally global constraints (such as epipolar geometry). In the second method the temporal continuity within a shot is used to compute invariant descriptors for tracked features, and these descriptors are the basic matching unit. The temporal information increases both the signal-to-noise ratio of the data and the stability of the computed features. We develop analogues of local spatial consistency, cross-correlation, and epipolar geometry for these tracks. Results of matching shots for a number of very different scene types are illustrated on two entire commercial films.
Penumbra: an Eclipse plugin for introductory programming
Authors: Frank Mueller, Antony L. Hosking
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Eclipse is a full-featured and easily extensible integrated development environment. As such, it has grown to include a large degree of functionality that may be overwhelming to the novice programmer. Nevertheless, we believe Eclipse is an environment that students of programming will come to find useful and empowering once they become familiar with it. The trick is easing them into using Eclipse without them feeling overwhelmed at the outset. Penumbra is an Eclipse plug-in developed at Purdue University for use in our introductory programming classes. It is intended to ease the transition to use of the full-featured functionality of Eclipse. Penumbra presents an Eclipse perspective that hides all but the basic actions of Eclipse's existing Java perspective, while packaging elements of other perspectives (e.g., the CVS perspective) into simpler actions that ease the downloading and turn-in of programming assignments, and adding new code views inspired by other environments for introductory programmers. Our experiences using Eclipse with a small group of introductory programming students in the Spring of 2003 have guided the development of Penumbra, which is now being rolled out for general use by the full class of 230 students in the Fall of 2003.
Exploring group mobility for replica data allocation in a mobile environment
Authors: Jiun-Long Huang, Ming-Syan Chen, Wen-Chih Peng
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

The growth in wireless communication technologies attracts a considerable amount of attention in mobile ad-hoc networks. Since mobile hosts in an ad-hoc network usually move freely, the topology of the network changes dynamically and disconnection occurs frequently. These characteristics make a mobile ad-hoc network be likely to be separated into several disconnected partitions, and the data accessibility is hence reduced. Several schemes are proposed to alleviate the reduction of data accessibility by replicating data items. However, little research effort was elaborated upon exploiting the group mobility where the group mobility refers to the phenomenon that several mobile nodes tend to move together. In this paper, we address the problem of replica allocation in a mobile ad-hoc network by exploring group mobility. We first analyze the group mobility model and derive several theoretical results. In light of these results, we propose a replica allocation scheme to improve the data accessibility. Several experiments are conducted to evaluate the performance of the proposed scheme. The experimental results show that the proposed scheme is able to not only obtain higher data accessibility but also produce lower network traffic than prior schemes.
Current Trends in the Adoption of the CMMI® Product Suite
Authors: Dave Zubrow
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper examines the current state ofadoption of the Capability Maturity Model®Integration (CMMI) Product Suite.It is based onappraisal reports submitted to and processed bythe Software Engineering Institute (SEISM) as ofJuly 10, 2003.Relevant appraisal data-including organization type, geographicdistribution, and appraisal history-are used todescribe CMMI adoption and use patterns.Thispaper also explains some characteristics of theappraisal process and obtained results.
The effect of advisement and goal orientation on mastery in a computer-based tutorial and simulation
Authors: Diana Lee Tepe
Venue:  (2003)

The primary purpose of this study was to determine the interaction of two advisement conditions (evaluative or adaptive) with goal orientation (learning or performance) and its impact on the ability of learners to achieve mastery when the instructional strategy made use of a combined tutorial and simulation instructional approach. The need for adult learners to transfer learning into the workplace demands that researchers consider how learners are impacted by new instructional approaches. It was anticipated that the findings would provide instructional designers with guidance on how to balance the quality triangle of time, cost, and quality when developing instruction. Suggestions based on educational and learning theory that improves quality without changing time or cost issues are needed. Participants completed a computer-based instructional unit that used a tutorial to present content, including an instructional simulation, followed by an assessment simulation. One week later, participants completed a performance-based assessment to measure the attainment of the performance-based objectives. Prior studies suggest that learning-oriented learners will outperform performance-oriented learners, and that adaptive advisement learners will outperform evaluative advisement learners on mastery attainment scores. However, research is unclear about the interaction of advisement and goal orientation, and the subsequent choices made by learners in computer-based instruction. Four hypotheses were tested in the study with an alpha level of .05 used for all statistical tests. While no statistically significant interaction or main effects were revealed, there are some promising areas for instructional designers to consider. Limitations of the study include the use of an all female sample from an urban southern university and the high number of learners who were both high learning-oriented and high performance-oriented. Suggestions for future research include the need to understand which learners are more likely to follow the advisement given, and how assessment of performance-based objectives varies between academic and work place environments.
Torus orientation
Authors: Synnöve Kekkonen-Moneta
Venue: Distributed Computing (2002)

A torus is oriented if the processes have assigned their communication links North-East-South-West labels in a globally consistent manner. This paper presents an orientation protocol that is self-stabilizing, i.e., resilient to corruption of data stored in working memories and communication links. The protocol is randomized, uses constant memory space, and orients tori where the processes do not know the network size and have no identifiers; probabilistic stabilization is proved under a restricted form of asynchrony and composite atomicity.
Knowledge and the Development of Interpersonal Trust: A Dynamic Model
Authors: Luis F. Luna-Reyes, Anthony M. Cresswell, George P. Richardson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

This paper presents a model of interpersonal trust dynamics, grounded in a longitudinal case study of an interorganizational information technology development project in New York State1. System dynamics is the simulation method selected in this theory-building effort, based on qualitative data collected by the Center for Technology in Government. The model integrates concepts from economic models, as well as psychological and sociological theories about trust, learning, and perceptual processes in interpersonal relations. The simulation experiments show plausible path dependent behaviors with the characteristic asymmetries between trust and distrust described both in the literature an in the case data. The role of trust and knowledge development in the success of these projects will be explored by combining models of sub processes into larger models of the overall collaboration. The value of the model as a theory building tool will be enhanced by extended data collection and combining with related process models.
A distributed, parallel, interactive volume rendering package
Authors: John S. Rowlan, G. Edward Lent, Nihar Gokhale, Shannon Bradshaw
Venue: Proceedings of the conference on Visualization '94 (1994)

This paper presents a parallel ray-casting volume rendering algorithm and its implementation on the massively parallel IBM SP-1 computer using the Chameleon message passing library. Though this algorithm takes advantage of many of the unique features of the SP-1 (e.g. high-speed switch, large memory per node, high-speed disk array, HIPPI display, et al), the use of Chameleon allows the code to be executed on any collection of workstations.The algorithm is image-ordered and distributes the data and the computational load to individual processors. After the volume data is distributed, all processors then perform local raytracing of their respective subvolumes concurrently. No interprocess communication takes place during the ray tracing process. After a subimage is generated by each processor, the final image is obtained by composing subimages between all the processers.The program itself is implemented as an interactive process through a GUI residing on a graphics work-station which is coupled to the parallel rendering algorithm via sockets. The paper highlights the Chameleon implementation, the GUI, some optimization improvements, static load balancing, and direct parallel display to a HIPPI framebuffer.