ppxscal/embedding_network huggingface dataset:
Improving Architectural Composability and Consumability using Communities: Lessons learned from Eclipse, SOA and MDA
Authors: Sridhar Iyengar
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

The last few years has seen a great acceleration in the convergence of two communities - the open standards community that is setting a foundation for how global, interoperable software intensive systems can be specified and the open source community which is implementing many of these standards. As the pace of software complexity continues to accelerate - we are assembling and integrating software that is produced by a global community - new challenges are driving architectural innovation. How can we design these systems with composability in mind while at the same time improving the productivity & consumability (by architects as well as users) of the systems we deliver? The move towards Model Driven Architecture (MDA) Service Oriented Architecture (SOA)- the 'Architecture word is respectable now! - and many of the open source projects at eclipse.org and apache.org that implement these specifications clearly illustrate this trend. What is missing? - A focus on "consumability" : How can we use motivating scenarios from end users that drive the implementation of these standards as we continue our thirst for simplifying and managing software complexity? The talk will conclude with some late breaking information on how some of the key emerging MDA and SOA standards are converging and building a foundation for the next wave of standards & innovation in Business Process Management.
Modelling work distribution mechanisms using Colored Petri Nets
Authors: Maja Pesic, Wil M. P. van der Aalst
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2007)

Workflow management systems support business processes and are driven by their models. These models cover different perspectives including the control-flow, resource, and data perspectives. This paper focuses on the resource perspective, i.e., the way the system distributes work based on the structure of the organization and capabilities/qualifications of people. Contemporary workflow management systems offer a wide variety of mechanisms to support the resource perspective. Because the resource perspective is essential for the applicability of such systems, it is important to better understand the mechanisms and their interactions. Our goal is not to evaluate and compare what different systems do, but to understand how they do it. We use Colored Petri Nets (CPNs) to model work distribution mechanisms. First, we provide a basic model that can be seen as a reference model of existing workflow management systems. This model is then extended for three specific systems (Staffware, FileNet, and FLOWer). Moreover, we show how more advanced work distribution mechanisms, referred to as resource patterns, can be modelled and analyzed.
Evaluating Software Engineering Processes in Commercial and Community Open Source Projects
Authors: Anthony I. Wasserman, Eugenio Capra
Venue: Proceedings of the First International Workshop on Emerging Trends in FLOSS Research and Development (2007)

We describe a current study for obtaining information about management of commercial and community open source projects. We have interviewed and surveyed leaders of more than 75 open source projects. Questions focused on the styles of leadership and communication, with a technical focus on testing and quality assurance processes. This paper describes the methods used to identify and contact subjects, as well as the questions posed and some results.
Co-Presence Communities: Using Pervasive Computing to Support Weak Social Networks
Authors: Jamie Lawrence, Terry R. Payne, David De Roure
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Although the strongest social relationships feature most prominently in our lives, we also maintain a multitude of much weaker connections: the distant colleagues that we share a coffee with in the afternoon; the waitress at a our regular sandwich bar; or the "familiar stranger' we meet each morning on the way to work. These are all examples of weak relationships which have a strong spatial-temporal component but with few support systems available. This paper explores the idea of "Co-presence Communities' - a probabilistic definition of groups that are regularly collocated together - and how they might be used to support weak social networks. An algorithm is presented for mining the Copresence Community definitions from data collected by Bluetooth-enabled mobile phones. Finally, an example application is introduced which utilises these communities for disseminating information.
Regression-Based Template Tracking in Presence of Occlusions
Authors: Ioannis Patras, Edwin Hancock
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper addresses the problem of efficient visual 2D template tracking in the presence of large motions and partial occlusions. We adopt a learning approach, in our case using a Bayesian Mixture of Experts (BME), in which observations at each frame yield direct predictions of the state (e.g. position / scale) of the tracked target. In contrast to other methods in the literature, we explicitly address the problem that the prediction accuracy can deteriorate drastically for observations that are not similar to the ones in the training set; such observations are common in case of partial occlusions or of fast motion. To do so, we couple the BME with a probabilistic kernel-based classifier which, when trained, can determine the probability that a new/unseen observation can accurately predict the state of the target (the 'relevance' of the observation in question). In addition, in the particle filtering framework, we derive a recursive scheme for maintaining an approximation of the posterior probability of the target's state in which the probabilistic predictions of multiple observations are moderated by their corresponding relevance. We apply the algorithm in the problem of 2D template tracking and demonstrate that the proposed scheme outperforms classical methods for discriminative tracking in case of motions large in magnitude and of partial occlusions.
The importance of usability testing of voting systems
Authors: Paul S. Herrnson, Richard G. Niemi, Michael J. Hanmer, Benjamin B. Bederson, Frederick G. Conrad, Michael Traugott
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

Expert reviews, laboratory tests, and a large-scale field study of one paper/optical scan and five electronic voting systems suggested numerous possible improvements. Changes could be made in all aspects of the process-signing-on, navigating across the ballot, checking and changing votes, casting write-in votes, and reviewing and casting the ballot. A paper trail was largely ignored by voters. Voters generally cast votes as intended, but complexities, such as changing votes and using a ballot with a straight-party feature, reduced voting accuracy. We call for additional usability research to examine new and altered systems, especially considering add-ons such as voter verifiable paper trails.
Virtualization: Old Technology Offers Huge New Potential
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

Industry consensus holds that once deployment and management costs are factored in, the typical enterprise spends US$10,000 to $15,000per x86 server per year on a nonvirtualized computing configuration. Yet, even though IBM pioneered the technology in its System 360 and370 mainframes in the 1960s and 1970s, the economics of PC-based computing architectures since the 1980s put large-scale virtualizationon the back burner. However, as x86-based data centers grow ever larger, corporate IT managers are beginning to turn their attention backto the old idea of virtualization. Essentially, virtualization uses a virtual machine monitor or host called a hypervisor to enable multiple operating system instances to run on a single physical server. The hypervisor can run directly on a given server's hardware platform, with the guest operating system running on a layer above the hypervisor. It can also run within an operating system, with the guest OS running on the third layer above the hardware.
Capstone term project for control systems curriculum
Authors: L. M. Hideg
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

In teaching an undergraduate controls course, several concepts are introduced. Students often perceive these materials as unrelated, thus of little application. There is a need to unify these concepts into larger problems. Examples could be presented in class, however, this would create a passive roll for the student. To encompass a larger number of concepts and involve the students, the capstone term project was incorporated into the course. It requires a large amount of design effort, appropriate use of class concepts and the use of a simulation language. This satisfies ABET design requirements and adds to students credentials by requiring a simulator such as MATLAB to successfully complete the project. Sophistication of the project encourages collaboration and team effort among the students, serious design consultation with the instructor, and other elements of a working engineering environment. Project reports for credit are individual submissions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Quality of services specification in distributed object systems design
Authors: Svend Frølund, Jari Koistinen
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

Traditional object-oriented design methods deal with the functional aspects of systems, but they do not address quality of service (QoS) aspects such as reliability, availability, performance, security, and timing. However, deciding which QoS properties should be provided by individual system components is an important part of the design process. Different decisions are likely to result in different component implementations and system structures. Thus, decisions about component-level QoS should be made at design time, before the implementation is begun. Since these decisions are an important part of the design process, they should be captured as part of the design. We propose a general Quality-of-Service specification language, which we call QML. In this paper we show how QML can be used to capture QoS properties as part of designs. In addition, we extend UML, the de-facto standard object-oriented modeling language, to support the concepts of QML. QML is designed to integrate with object-oriented features, such as interfaces, classes, and inheritance. In particular, it allows specification of QoS properties through refinement of existing QoS specifications. Although we exemplify the use of QML to specify QoS properties within the categories of reliability and performance, QML can be used for specification within any QoS category-QoS categories are user-defined types in QML.
Cautious virus detection in the extreme
Authors: John Case, Samuel E. Moelius,  III
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

It is well known that there exist viruses whose set of infected programs is undecidable. If a virus detector is to err on the side of caution with respect to such a virus, then it must label some perfectly innocent programs as being infected by the virus. Can there exist a virus whose set of infected programs is so unwieldy that any cautious virus detector must label all but finitely many programs as being infected by the virus â even when infinitely many programs are not infected by the virus? Although such viruses can exist, strong theoretical evidence is presented that such a virus is unlikely to be encountered in the real world. Several of our proofs employ infinitary self-reference arguments
An Immersive Game for K-5 Math and Science Education
Authors: Nicoletta Adamo-Villani, Ronnie Wilbur
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We present SMILE (Science and Math in an Immersive Learning Environment) an immersive game in which deaf and hearing children ages 5-10 learn math and science concepts and ASL (American Sign Language) terminology through interaction with animated 3D characters and objects. The application can be displayed in stationary, four-wall immersive devices (i.e., the FLEX), Fish Tank VR systems, and non-immersive standard computer systems. Users interact with the program choosing from a variety of input devices including a 6DOF wand, a pinch glove, a data glove, a dance platform, or standard mouse and keyboard.
A fast weighted subband adaptive algorithm
Authors: K. Mayyas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The block algorithm has illustrated significant improvement in performance over the NLMS algorithm. However, it is known that block processing algorithms have lower tracking capabilities than their sample-by-sample counterparts. The fast affine projection (FAP) algorithm also outperforms the NLMS with a slight increase in complexity, but involves the fast calculation of the inverse of a covariance matrix of the input data that could undermine the performance of the algorithm. In this paper, we present a sample-by-sample version of the block algorithm and develop a low complexity implementation of this algorithm using a similar approach to the FAP algorithm. The new fast algorithm does not require matrix inversion thus alleviating the drawbacks of the FAP algorithm. A variable step size version of the proposed algorithm is also presented.
Chinese all syllables recognition using combination of multiple classifiers
Authors: Liang Zhou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Chinese all syllables recognition is described. Chinese all syllables recognition is divided into base syllable recognition disregarding the tones and 4 tones recognition. For base syllable recognition, we used a combination of two multisegment vector quantization (MSVQ) classifiers based on different features (instantaneous and transitional features of speech). For the tones recognition, the vector quantization (VQ) classifier is first used, and is comparable to a multilayer perceptron (MLP) classifier. Next, a combination of a distortion based classifier (VQ) and a discriminant based classifier (MLP) is proposed. An evaluation has been carried out using the standard Chinese syllable database CRDB, and experimental results have shown that the combined classifiers can improve the recognition performance. The recognition accuracy for base syllable and tones is 96.48% and 99.82% respectively.
Mined-knowledge and Decision Support Services in Electronic Health
Authors: Kamran Sartipi, Mohammad H. Yarmand, Douglas G. Down
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Large organizations in various information domains are constantly facing the challenges of growing size, new business requirements, and customer demands for service agility. As an example, in the healthcare domain provision of unique electronic health record systems (EHR) for patient identification and health history, integration of regional systems into a nation-wide system, information and service sharing, and security and privacy of patient data have generated a set of new challenges. Canada Health Infoway has proposed an information infrastructure for networked healthcare systems that is based on service oriented architecture (SOA) and provides standards for sharing data and services. In this paper, we investigate the provision of mined-knowledge (results of data mining on patient data), clinical decision support systems, and network visualization and monitoring through SOA. We also address the advantages of SOA implementation using an enterprise service bus in order to accommodate these services. Such services can benefit similar domains such as banking, communications, air traffic control, and transportation.
A Modified BISK Algorithm for 3D Dual-TreeWavelet Transform Coding
Authors: Joseph B. Boettcher, James E. Fowler
Venue: Proceedings of the 2007 Data Compression Conference (2007)

While traditional video coders employ a block-based feedback loop of motion estima- tion and motion compensation (ME/MC) to exploit the temporal redundancy in a video signal, other systems have avoided the ME/MC feedback loop by applying a wavelet trans- form in the temporal direction via motion-compensated temporal filtering (MCTF). How- ever, an alternative to these ME/MC-based approaches has arisen recently in the form of the dual-tree complex discrete wavelet transform (DDWT1). The DDWT is a redundant transform that, in the 3D case, produces four times as many subbands as the DWT, with each subband oriented in a different direction. When applied to a video signal, these orien- tations help isolate salient signal features moving in different directions, providing inherent motion selectivity. The ability of the transform to describe motion without explicitME/MC has motivated the use of the DDWT in video-coding systems looking to avoid the compu- tational complexity associated with motion estimation. However, since the 3D DDWT is four times redundant, efficient coding of the transform coefficients is a challenging task.
Software as a Service: Implications for Investment in Software Development
Authors: Vidyanand Choudhary
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Software as a Service (SaaS) is a rapidly growing model of software licensing. In contrast to traditional software where users buy a perpetual-use license, SaaS users buy a subscription from the publisher. Whereas traditional software publishers typically release new product features as part of new versions of software once in a few years, publishers using SaaS have an incentive to release new features as soon as they are completed. We show that this property of the SaaS licensing model leads to greater investment in product development under most conditions. This increased investment leads to higher software quality in equilibrium under SaaS compared to perpetual licensing. The software publisher earns greater profits under SaaS while social welfare is also higher.
Fast Multi-scale Template Matching Using Binary Features
Authors: Feng Tang, Hai Tao
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Template matching is one of the key problems in computer vision and has been widely used in tracking, recognition and many other applications. Traditional methods are usually slow because the template needs to be matched to every location in the image and the matching involves element-byelement floating point multiplications. The process is even slower when multi-scale matching is needed. This makes it not suitable for time-critical applications. In this paper, we present a novel approach to accelerate multi-scale template matching. The main computation saving is achieved by representing the template as a linear combination of a small number of Haar-like binary features. This representation replaces the element-by-element floating point multiplications with several additions thus significantly improves the speed. In addition, such simple features can easily adapt to template scale changes with negligible extra computation cost. Experiments show that the proposed method can achieve speed improvement up to two orders of magnitude.
Collaborating against common enemies
Authors: Sachin Katti, Balachander Krishnamurthy, Dina Katabi
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

This paper presents the first wide-scale study of correlated attacks, i.e., attacks mounted by the same source IP against different networks. Using a large dataset from 1700 intrusion detection systems (IDSs), we show that correlated attacks are prevalent in the current Internet; 20% of all offending sources mount correlated attacks and they account for more than 40% of all the IDS alerts in our logs. We also reveal important characteristics of these attacks. Correlated attacks appear at different networks within a few minutes of each other, indicating the difficulty of warding off these attacks by occasional offline exchange of lists of malicious IP addresses. Furthermore, correlated attacks are highly targeted. The 1700 IDSs can be divided into small groups with 4-6 members that do not change with time; IDSs in the same group experience a large number of correlated attacks, while IDSs in different groups see almost no correlated attacks. Our results have important implications on collaborative intrusion detection of common attackers. They show that collaborating IDSs need to exchange alert information in realtime. Further, exchanging alerts among the few fixed IDSs in the same correlation group achieves almost the same benefits as collaborating with all IDSs, while dramatically reducing the overhead.
Fixed and Adaptive Sequential Prefetching in Shared Memory Multiprocessors
Authors: Fredrik Dahlgren, Michel Dubois, Per Stenstrom
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

To offset the effect of read miss penalties on processor utilization in shared-memory multiprocessors, several software- and hardware-based data prefetching schemes have been proposed. A major advantage of hardware tech niques is that they need no support from the programmer or compiler. Sequential prefetching is a simple hardware-controlled prefetching technique which relies on the automatic prefetch of consecutive blocks following the block that misses in the cache. In its simplest form, the number of prefetched blocks on each miss is fixed throughout the exe cution. However, since the prefetching efficiency varies during the execution of a program, we propose to adapt the number of pref etched blocks according to a dynamic measure of prefetching effectiveness. Simulations of this adaptive scheme show significant reductions of the read penalty and of the overall execution time.
Designing home availability services
Authors: Kristine S. Nagel, Ja-Young Sung, Gregory D. Abowd
Venue: Personal and Ubiquitous Computing (2007)

We have explored the challenges of designing domestic services to help family and friends determine mutually agreeable times to call one another. In a prior study, we identified activities in the home that predict availability to an external interruption. In our follow-up study, we used a cooperative design activity to see which, if any, of these home activities the family member is willing to share when engaged in mealtime or leisure routine. The data people are willing to reveal is more detailed for mealtime, than leisure activities. Furthermore, the shared availability service needs to be accessible throughout the home, in either compact, portable form or integrated with other services in various room locations. Accuracy and reliability of the shared information, along with device independent caller identification are also essential design requirements. While not unique to the home, the desire to personalize and present a socially acceptable availability status is extremely important.