ppxscal/embedding_network huggingface dataset:
Do Viewpoints Lead to Better Conceptual Models? An Exploratory Case Study
Authors: Steve Easterbrook, Eric Yu, Jorge Aranda, Yuntian Fan, Jennifer Horkoff, Marcel Leica, Rifat Abdul Qadir
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The use of viewpoints has long been proposed as a technique to structure evolving requirements models. In theory, viewpoints should provide better stakeholder traceability, and the ability to discover important requirements by comparing viewpoints. However, this theory has never been tested empirically. This paper reports on an exploratory case study of a key hypothesis of the viewpoints theory, namely that by creating separate viewpoint models to represent different stakeholder contributions, and explicitly merging them, important hidden requirements can be discovered. The case study compared two modelling teams using the i*notation to capture requirements for new webbased counselling services for a large charitable organisation. One team used viewpoints; the other did not. The conclusions include that viewpoint merging improves the understanding of the problem domain, but is very time consuming. The process of merging was more important than the merged product. The study also indicates a need for better model management tools, as both teams encountered dif- ficulty in managing large, evolving models.
Wireless access and electrical markets: Becoming similar?
Authors: Shane Greenstein
Venue: IEEE Micro (2005)

The Wi-Fi market has achieved a certain level of reliability and still has a ways to go. Vendors and sellers should not buy into seductive and wishful thinking. Instead recognize reliability when it arrives and be thankful for a blissful, albeit brief, respite from another inevitable period of experimentation.
Combining QoS-based Service Selection with Performance Prediction
Authors: Zhengdong Gao, Gengfeng Wu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Currently, much efforts have being focused on dynamic, personalized QoS-based service selection, however, current QoS models are generally composed of static QoS parameters and haven't taken the dynamic nature of service performance into consideration. In our framework, we extend existing QoS model by adding new attributes that reflect performance of services and rely on ANN to provide client dynamic, on demand service performance prediction. Through this way, a client may be more capable of finding the best service based both on his/her preferences and on the service performance estimation.
Scalable Store-Load Forwarding via Store Queue Index Prediction
Authors: Tingting Sha, Milo M. K. Martin, Amir Roth
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

Conventional processors use a fully-associative store queue (SQ) to implement store-load forwarding. Associative search latency does not scale well to capacities and bandwidths required by wide-issue, large window processors. In this work, we improve SQ scalability by implementing store-load forwarding using speculative indexed access rather than associative search. Our design uses prediction to identify the single SQ entry from which each dynamic load is most likely to forward. When a load executes, it either obtains its value from the predicted SQ entry (if the address of the entry matches the load address) or the data cache (otherwise). A forwarding mis-prediction¿detected by pre-commit filtered load re-execution-results in a pipeline flush. SQ index prediction is generally accurate, but for some loads it cannot reliably identify a single SQ entry. To avoid flushes on these difficult loads while keeping the single-SQ-access-per-load invariant, a second predictor delays difficult loads until all but the youngest of their "candidate" stores have committed. Our predictors are inspired by store-load dependence predictors for load scheduling (Store Sets and the Exclusive Collision Predictor) and unify load scheduling and forwarding. Experiments on the SPEC2000 and MediaBench benchmarks show that on an 8-way issue processor with a 512-entry reorder buffer, our technique performs within 3.3% of an ideal associative SQ (same latency as the data cache) and either matches or exceeds the performance of a realistic associative SQ (slower than data cache) on 31 of 47 programs.
A 2D Vibration Array for Sensing Dynamic Changes and 3D Space for Blinds' Navigation
Authors: N. Bourbakis, D. Kavraki
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

This paper presents a 2D vibration array for detecting dynamic changes in 3D space during navigation and provides these changes in real-time to visual impaired users (in a form of vibration) in order to develop a 3D sensing of the space and assist their navigation in their working and living environment. This vibration array is a part of the Tyflos prototype device (consisting of two tiny cameras, a microphone, an ear speaker mounted into a pair of dark glasses and connected into a portable PC) for blind individuals. The overall idea is of detecting changes in a 3D space is based on fusing range data and image data captured by the cameras and creating the 3D representation of the surrounding space. This 3D representation of the space and its changes are mapped onto a 2D vibration array placed on the chest of the blind user. The degree of vibration offers a sensing of the 3D space and its changes to the user.
Authorization for digital rights management in the geospatial domain
Authors: Andreas Matheus
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

Since information is available in digital format, the protection of intellectual property and copyright fraud has become an important issue. This is, because the digital content can be copied without quality loss and with a reasonable effort of time, equipment and money. After copying, it can be distributed using the Internet, again with little effort of time and money. In such an environment, the loss of revenue for the music and film industry -- not only due to sites like Napster -- is becoming so tremendous, that mechanisms as described under the Digital Rights Management become important. In the geospatial domain, Spatial Data Infrastructures emerge that have the potential to provide high quality and up-to-date geographic information. This enables the endeavor of new market potentials and the creation of new business cases. However, the establishment of Digital Rights Management for geographic information is important in the first place. This paper introduces requirements for geospatial Digital Rights Management and illustrates the difference to known requirements for the music industry. The major contribution of this paper is the description of geospatial access control -- named GeoXACML -- as it can possibly be a solution to the authorization requirement for Digital Rights Management in the geospatial domain.
Distribution of digital contents based on public key considering execution speed and security
Authors: Il Seok Ko, Choon Seong Leem, Yun Ji Na, Chui Young Yoon
Venue: Information Sciences: an International Journal (2005)

Information security is becoming a more important factor in distribution of digital contents. Generally, illegal facsimile of high-quality multimedia products such as DVDs, MP3s and AACs is possible without damaging quality. Thus, the illegal distribution of duplicated contents on the Web is causing digital content providers great economic loss. Therefore, a study of security and efficient distribution of digital contents is required.The most important issues in the design of a digital content distribution system are user convenience, execution speed and security. In this study, we designed a digital contents distribution system that uses web caching technology and encryption/decryption techniques in hierarchical structures. We propose a digital content distribution system that improves user convenience, security and execution speed. The superior performance of the proposed system has been proven in the tests. The results of experiment show that the developed system has improved the security of DC without decreasing process speed.
Williams Voted 2006 Computer Society President-Elect
Authors: Bob Ward
Venue: Computer (2005)

A summary of the recent election results provides Computer Society members information about officers elected to serve terms beginning in January 2006.
Approaches to Grey Prediction and Control of Environmental Systems
Authors: Weizhen Chen, Zhijie Chen, Qile Chen, Mian-Yun Chen
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

An environment is a very complex and large system. This paper describes it with the aid of the grey systems approach. Firstly, the grey system and grey process are outlined, then the latest researches on grey prediction and control of environmental systems are presented. This kind of systems designed here is best suited for investigating the environmental objects with "poor" information.
Condition Numbers of Gaussian Random Matrices
Authors: Zizhong Chen, Jack J. Dongarra
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Let $G_{m \times n}$ be an $m \times n$ real random matrix whose elements are independent and identically distributed standard normal random variables, and let $\kappa_2(G_{m \times n})$ be the 2-norm condition number of $G_{m \times n}$. We prove that, for any $m \geq 2$, $n \geq 2$, and $x \geq |n-m|+1$, $\kappa_2(G_{m \times n})$ satisfies ${\scriptsize \frac{1}{\sqrt{2\pi}}} ( { c }/{x} )^{|n-m|+1} x )}
Business Component Identification of Enterprise Information System: A hierarchical clustering method
Authors: Meng Fan-Chao, Zhan Den-Chen, Xu Xiao-Fei
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Business Component Identification is recognized as one of the greatest important phase in the process of Component-Based Software Development (CBSD). This paper presents an approach to identify business components from domain business model. First a domain business model of enterprise information system is proposed, and it is the input of business components identification phase. To identify business components, a hierarchical clustering technique based on graph is proposed. This method proposed differs from traditional clustering technology, and it uses the edge strength to substitute for edge weight. In the process of business components identification, we consider cohesion, coupling, granularity and number of business components. To acquire high quality business components, we give the rule of evaluation of business components, which consider mainly non-functional factors such as capacity, cost, security etc. Finally, quality management subsystem is used as example to describe the method of business component identification.
A scalable approach to the partition of QoS requirements in unicast and multicast
Authors: Ariel Orda, Alexander Sprintson
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. An important problem in this context is how to partition QoS requirements along a selected topology (path for unicast and tree for multicast). As networks grow in size, the scalability of the solution becomes increasingly important. This calls for efficient algorithms, whose computational complexity is less dependent on the network size. In addition, recently proposed precomputation-based methods can be employed to facilitate scalability by significantly reducing the time needed for handling incoming requests.We present a novel solution technique to the QoS partition problem(s), based on a "divide-and-conquer" scheme. As opposed to previous solutions, our technique considerably reduces the computational complexity in terms of dependence on network size; moreover, it enables the development of precomputation schemes. Hence, our technique provides a scalable approach to the QoS partition problem, for both unicast and multicast. In addition, our algorithms readily generalize to support QoS routing in typical settings of large-scale networks.
'Location is not enough!': an Empirical Study of Location-Awareness in Mobile Collaboration
Authors: Nicolas Nova, Fabien Girardin, Pierre Dillenbourg
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

There is an ever growing number of mobile learning applications based on location-awareness, However, there is still a lack of information concerning how it might impact socio-cognitive processes involved in collaboration. This is what the following empirical study aimed to address. We used a mobile and collaborative game, running on Tablet PCs, to test two conditions. In one experimental condition, groups could see the positions of each member; while in the other location-awareness was not provided. All users could use the Tablet PC to communicate through annotations. We found no differences between the two conditions with regard to the task performance. Neither were there any differences in terms of cognitive workload. However, players without the location-awareness indications had a better representation of their partners' paths. They wrote more messages and better explicated their strategies. The paper concludes with remarks about how this can be taken into account by mobile learning practitioners.
A web-based architecture and incremental authoring model for interactive learning environments for diagnostic reasoning
Authors: Christopher K. Riesbeck
Venue:  (2005)

Computer-based learning environments have been used to provide simulated settings for problem-based learning. In prior research, a standalone software tool called INDIE was built for authoring and delivering learning environments where students can run simulated tests, collect data, generate hypotheses, and construct arguments. INDIE includes a run-time engine and an authoring tool. Approximately a dozen applications were developed using that system.This dissertation describes a new version of INDIE and a new approach to authoring and deploying learning environments. The new INDIE enhances the authenticity of the learning environment by simulating important real-life aspects such as time and cost, and supporting complex and random test result generation. More importantly, the new INDIE improves the accessibility of learning environments by using a web-based client-server architecture that allows students to interact with learning environments through web browsers. This architecture reduces the difficulty of authoring at run-time by allowing authoring to be done on a centralized server without any change on the client side. In addition, the web-based INDIE authoring tool facilitates authoring with support such as completeness check, preview of authoring results, and automatic retrieval of previously used values. The new INDIE architecture includes the instructor in the feedback loop to complement system feedback and collect materials for authoring. This approach extends system ability to support actions not available to students and allows the instructor to assess student work in the learning environment. Significant up-front development effort can be avoided by authoring the learning environment incrementally during real use. The current INDIE has been used to build Corrosion Investigator, a learning environment where environmental engineering students take the role of consultants helping a paper processing company determine the cause of recurring pipe corrosion. Results from the use of Corrosion Investigator in class show that Corrosion Investigator successfully facilitated the delivery of a problem-based learning module and at the same time reduced the workload for the instructor. Formative evaluation of the authoring tool and the interface for the instructor to provide feedback to students suggest positive results.
Dynamic Signature Verification Using Discriminative Training
Authors: Gregory F. Russell, Jianying Hu, Alain Biem, Andre Heilper, Dmitry Markman
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper we describe a new approach to dynamic signature verification using the discriminative training framework. The authentic and forgery samples are represented by two separate Gaussian Mixture models and discriminative training is used to achieve optimal separation between the two models. An enrollment sample clustering and screening procedure is described which improves the robustness of the system. We also introduce a method to estimate and apply subject norms representing the "typical": variation of the subject's signatures. The subject norm functions are parameterized, and the parameters are trained as an integral part of the discriminative training. The system was evaluated using 480 authentic signature samples and 260 skilled forgery samples from 44 accounts and achieved an equal error rate of 2.25%.
Prefatory material
Authors: Diana Patterson
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

People use books in vastly different ways. Some start at the front, some at the back, and some open to a random place and begin to read. I have noticed that very few people ever read anything before "Chapter I." This was brought home to me recently when I read a book which had1. a dedication,2. an advertisement,3. a table of contents,4. a preface,5. appendices (A & B) to the Preface,6. a preface to the Third Edition, and 7. an Introduction. 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
Analysis of the ATLAS Rome Production Experience on the LHC Computing Grid
Authors: Simone Campana, Dario Barberis, Frederic Brochu, Alessandro De Salvo, Flavia Donno, Luc Goossens, Santiago Gonzalez de la Hoz, Tommaso Lari, Dietrich Liko, Julio Lozano, Guido Negri, Laura Perini, Gilbert Poulard, Silvia Resconi, David Rebatto, Luca Vaccarossa
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The Large Hadron Collider at CERN will start data acquisition in 2007. The ATLAS (A Toroidal LHC ApparatuS) experiment is preparing for the data handling and analysis via a series of Data Challenges and production exercises to validate its computing model and to provide useful samples of data for detector and physics studies. The last Data Challenge, begun in June 2004 and ended in early 2005, was the first performed completely in a Grid environment. Immediately afterwards, a new production activity was necessary in order to provide the event samples for the ATLAS physics workshop, taking place in June 2005 in Rome. This exercise offered a unique opportunity to estimate the reached improvements and to continue the validation of the computing model. In this paper we discuss the experience of the "Rome production" on the LHC Computing Grid infrastructure, describing the achievements, the improvements with respect to the previous Data Challenge and the problems observed, together with the lessons learned and future plans.
The clinical microscopy laboratory system
Authors: M. Barry Dumas, David Valinsky
Venue: ACM SIGSIM Simulation Digest (1973)

This paper deals with the simulation of hospital laboratories --- in particular the clinical microscopy laboratory system. This system is representative of those that deal with the patient indirectly. While analyses are made of samples drawn from patients, the patients' presence is not required for test performance.The nature of the simulator which has been developed is discussed. Special reference is made to five particular aspects whose treatment defines the basic characteristics of any such simulator: event definitions and timing; demand characterization; decision variables; output data management; measures of effectiveness. Emphasis is on the approaches taken rather than the programming details used.
Control Path Implementation for a Low-Latency Optical HPC Switch
Authors: Cyriel Minkenberg, Francois Abel, Peter Muller, Raj Krishnamurthy, Mitchell Gusat, B. Roe Hemenway
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

A crucial part of any high-performance computing system is its interconnection network. In the OSMOSIS project, Corning and IBM are jointly developing a demonstrator interconnect based on optical cell switching with electronic control. Starting from the core set of requirements, we present the system design rationale and show how it impacts the practical implementation. Our focus is on solving the technical issues related to the electronic control path, and we show that it is feasible at the targeted design point.
DYNAMIC DATA-DRIVEN INVERSION FOR TERASCALE SIMULATIONS: REAL-TIME IDENTIFICATION OF AIRBORNE CONTAMINANTS
Authors: VOLKAN AKCELIK, GEORGE BIROS, ANDREI DRAGANESCU, JUDITH HILL, OMAR GHATTAS, BART VAN BLOEMEN WAANDERS
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynamic observations. DDD simulations give rise to inverse problems of determining unknown data from sparse observations. The main difficulty is that the optimality system is a boundary value problem in 4D space-time, even though the forward simulation is an initial value problem. We construct special-purpose parallel multigrid algorithms that exploit the spectral structure of the inverse operator. Experiments on problems of localizing airborne contaminant release from sparse observations ina regional atmospheric transport model demonstrate that 17-million-parameter inversion can be effected at a cost of just 18 forward simulations with high parallel efficiency. On 1024 Alphaserver EV68 processors, the turnaround time is just 29 minutes. Moreover, inverse problems with 135 million parameters - corresponding to 139 billion total space-time unknowns - are solved in less than 5 hours on the same number of processors. These results suggest that ultra-high resolution data-driven inversion can be carried out sufficiently rapidly forsimulation-based "real-time" hazard assessment.
VHDL Simulation and Modeling of an All-Digital RF Transmitter
Authors: Robert Bogdan Staszewski, Roman Staszewski, Poras T. Balsara
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

We describe a simulation technique that uses an event-driven VHDL simulator to model an RF wireless transmitter. The technique is well suited to investigate complex interactions in large SoC systems, where traditional RF and analog simulation tools do not work effectively. The oscillator phase noise characteristics are described using time-domain equations. The flip-flop metastability effects on the system performance are also modeled. The VHDL simulation environment was selected for its high simulation speed, the direct correlation between the simulated and built circuits and its ability to model mixed-signal systems of high complexity. The presented simulation technique has been successfully applied and validated in a single-chip GSM/EDGE transceiver IC fabricated in a digital 90 nm process.