ppxscal/embedding_network huggingface dataset:
A usability comparison of three alternative message formats for an SMS banking service
Authors: G. Peevers, G. Douglas, M. A. Jack
Venue: International Journal of Human-Computer Studies (2008)

The study reported here compares the usability of three types of message input format: Abbreviations, Numbers and Free-Form as alternatives for a Pull SMS banking service. Participants (N=74) used all three formats to carry out three banking transactions in a repeated measures experiment. The Abbreviations and Numbers versions of the service performed to generally equal levels in all metrics. Free-Form performed the worst as participants took significantly longer to complete tasks and it received significantly lower overall questionnaire and quality scores for satisfaction. The older age group found all three versions in general to be less usable than the younger age group. They took longer on the tasks, had lower completion rates and they also gave each version a lower overall mean satisfaction score.
A Framework for Reliability Assessment and Enhancement in Multi-Processor Systems-On-Chip
Authors: G. Beltrame, C. Bolchini, L. Fossati, A. Miele, D. Sciuto
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Reliability issues play a relevant role in the design of embedded systems for critical ap- plications; this and the always increasing performance requirements lead to the adoption of new architectural solutions, as shown by the introduction of Multi-Processor Systems-on- Chip (MPSoC). MPSoCs raise new challenges related to the complexity of the interactions among several independent cores. This paper presents a framework, based on a simulation platform, for the design of this kind of embedded systems; the framework supports the use of reliability techniques in order to address fault detection and tolerance issues. The simu- lation platform is also adopted for a reliability assessment task, achieved by exploiting fault injection targeting each component of the system and by monitoring the effects on the entire architecture.
The Integrated Strategic Information System Planning Methodology
Authors: Pakorn Surmsuk, Suchai Thanawastien
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

This paper describes a new strategic information system planning methodology, called ISISP (Integrated Strategic Information System Planning), which combines both top- down and bottom-up methodologies for strategic information system planning. In ISISP, portfolio derived from CRUD matrix will union with portfolio derived from SWOT/strategic themes which results in three sets of applications, namely the existing non-core applications, the core applications and the future applications. Then application transformation is applied to both core and non core application groups. For the future application group, each application will be mapped onto the existing CRUD matrix resulting in a new CRUD matrix, called ICRUD, which represents the information architecture that bridges the existing applications to the future strategically derived mission critical applications. The ISISP methodology therefore facilitates the actual implementations since all application boundaries will be derivable for the ICRUD matrix. Also, the business areas will be focused and realistic. The resultant application portfolio would be more suitable for creating IT-enabled enterprise since both existing and future strategic applications are taken care for.
Breaking the Man-Machine Communication Barrier
Authors: P. Hayes
Venue: Computer (1981)

How can interactive systems be made more helpful and responsive? This tool-independent system cuts down frustration by incorporating many of the communications shortcuts people use naturally.
A delay critical value in TCP Fluid Control
Authors: Hong-yong Yang, Qun-san Xu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A class of Internet TCP fluid control algorithms with communication delays is studied. A critical value of the delay to ensure the stability of Internet is presented by analyzing the algorithm. By enlarging the delay across the critical value, we prove that the TCP-Like algorithm exhibits periodic oscillation. Finally, a numerical simulation is used to verify the theoretical results. Our results have shown that the communication delay is one of the key factors to affect the quality of service (Qos) of Internet and plays an important role in communicating process of Internet.
R68-51 The Design of an Automatic Patching System
Authors: G. Hannauer
Venue: IEEE Transactions on Computers (1968)

"Getting rid of the patchpanel" has long been the dream of analog computer users (and designers). Besides the aesthetic value of eliminating "all those messy wires," there are the more substantial advantages of shortened turnaround time, long-term low-cost problem storage and greatly simplified programming. 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
Parallel Discrete-Event Simulation
Authors: Walid Najjar, Jean-luc Jezouin, Jean-luc Gaudiot
Venue: IEEE Design Test (1987)

The availability of commercial multiprocessors gives a new importance to distributed simulation. However, while existing techniquesexploit some levels of parallelism in the discrete-event simulation algorithm, they are usually targeted to specific applicationsand architectures. In the general scheme presented here, the algorithm is executed in parrallel using a compilation strategythat can be implemented on shared-memory multiprocessors.
A parallel genetic local search algorithm for intrusion detection in computer networks
Authors: Mohammad Saniee Abadeh, Jafar Habibi, Zeynab Barzegar, Muna Sergi
Venue: Engineering Applications of Artificial Intelligence (2007)

The security of networked computers plays a strategic role in modern computer systems. This task is so complicated because the determination of normal and abnormal behaviors in computer networks is hard, as the boundaries cannot be well defined. One of the difficulties in such a prediction process is the generation of false alarms in many anomaly based intrusion detection systems. However, fuzzy logic is an important solution to reduce the false alarm rate in determining intrusive activities. This paper proposes a parallel genetic local search algorithm (PAGELS) to generate fuzzy rules capable of detecting intrusive behaviors in computer networks. The system uses the Michigan's approach, where each individual represents a fuzzy rule which has the form ''if condition then prediction.'' In the presented algorithm the global population is divided into some subpopulations, each assigned to a distinct processor. Each subpopulation consists of the same class fuzzy rules. These rules evolve independently in the proposed parallel manner. Experimental results show that the presented algorithm produces fuzzy rules, which can be used to construct a reliable intrusion detection system.
Promoting critical thinking with computer mediated communication technology
Authors: Wei Wei Goh, Barbara Dexter, William D. Murphy
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

The paper explores how computer mediated communication can be used to effectively promote critical thinking skills among online learners in higher education. Critical thinking is a process of actively and skillfully conceptualizing and constructing information to become one's own knowledge. The effective use of a new technology needs to be related to how learners learn. This paper attempts to examine the learning theory underlying computer mediated communication and discusses cognitivism, collaborative learning, constructivism and situated learning. The latest technologies in computer mediated communication are investigated further by identifying the potential as learning tools. The definition of internalization may throw light on the key question of this study. Finally, we conceptualize the idea that computer mediated communication could promote critical thinking among learners through internalization within a community of learners.
Uniform Selection of Feasible Paths as a Stochastic Constraint Problem
Authors: Matthieu Petit, Arnaud Gotlieb
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Automatic structural test data generation is a real challenge of Software Testing. Statistical structural testing has been proposed to address this problem. This testing method aims at building an input probability distribution to maximize the coverage of some structural criteria. Under the all paths testing objective, statistical structural testing aims at selecting each feasible path of the program with the same probability. In this paper, we propose to model a uniform selector of feasible paths as a stochastic constraint program. Stochastic constraint programming is an interesting framework which combines stochastic decision problem and constraint solving. This paper reports on the translation of uniform selection of feasible paths problem into a stochastic constraint problem. An implementation which uses the library PCC(FD) of SICStus Prolog designed for this problem is detailed. First experimentations, conducted over a few academic examples, show the interest of our approach.
The boundary between privacy and utility in data publishing
Authors: Vibhor Rastogi, Dan Suciu, Sungho Hong
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We consider the privacy problem in data publishing: given a database instance containing sensitive information "anonymize" it to obtain a view such that, on one hand attackers cannot learn any sensitive information from the view, and on the other hand legitimate users can use it to compute useful statistics. These are conflicting goals. In this paper we prove an almost crisp separation of the case when a useful anonymization algorithm is possible from when it is not, based on the attacker's prior knowledge. Our definition of privacy is derived from existing literature and relates the attacker's prior belief for a given tuple t, with the posterior belief for the same tuple. Our definition of utility is based on the error bound on the estimates of counting queries. The main result has two parts. First we show that if the prior beliefs for some tuples are large then there exists no useful anonymization algorithm. Second, we show that when the prior is bounded for all tuples then there exists an anonymization algorithm that is both private and useful. The anonymization algorithm that forms our positive result is novel, and improves the privacy/utility tradeoff of previously known algorithms with privacy/utility guarantees such as FRAPP.
An Alternative to the Rayleigh Curve Model for Software Development Effort
Authors: F. N. Parr
Venue: IEEE Transactions on Software Engineering (1980)

A new model of the software development process is presented and used to derive the form of the resource consumption curve of a project over its life cycle. The function obtained differs in detail from the Rayleigh curve previously used in fitting actual project data. The main advantage of the new model is that it relates the rate of progress which can be achieved in developing software to the structure of the system being developed. This leads to a more testable theory, and it also becomes possible to predict how the use of structured programming methods may alter pattems of life cycle resource consumption.
Content-based Search using Term Aggregation and Classification over Hybrid Peer-to-Peer Systems
Authors: Aoying Zhou, Rong Zhang, Quang Hieu Vu, Weining Qian
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In this paper, we propose a method to support contentbased search, one of the challenges in Peer-to-Peer file sharing system. The proposed method is based on a hybrid structure, which is a combination of a Chord ring and a balanced tree. The tree is used to aggregate and classify terms while the Chord ring is used to index terms of nodes in the tree. At every node in the tree, the system classifies terms as either important or unimportant. Important terms of a node, which can distinguish the node from its neighbor nodes, are indexed in the Chord ring while unimportant terms that are either popular or rare terms are aggregated to higher level nodes. Based on the classification, the system can process queries on the fly without the need of global knowledge. Therefore, our system can avoid the problem of bottleneck at nodes keeping global knowledge and the expensive cost of synchronization global knowledge among these nodes. We have done extensive experiments to validate the effectiveness and efficiency of our proposal.
Counting Responders in an Associative Memory
Authors: C. C. Foster, F. D. Stockton
Venue: IEEE Transactions on Computers (1971)

A method of determining the number of responders to a search in an associative memory is presented. It is shown that less than one full adder per memory cell is required and that the maximum delay in establishing the count is proportional to n, where n is the log to the base 3 of the number of memory cells.
New Aspects of InkML for Pen-Based Computing
Authors: S. Watt
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

As pen-based computing becomes more prevalent, it is increasingly important to be able to share ink across ap- plications and across platforms. The emerging standard Ink Markup Language (InkML) is intended for this purpose. Four drafts of the proposed standard have been produced since 2003, resulting in a specification with broad input from industry and invited experts. The last working draft has simplified and generalized the specification in some im- portant ways and the specification is now in "last call" sta- tus. This paper presents an overview of the main features of InkML, with an emphasis on the rationale for what has changed for the last call version.
An Empirical Study of the Relationship of Stability Metrics and the QMOOD Quality Models Over Software Developed Using Highly Iterative or Agile Software Processes
Authors: Patricia L. Roden, Shamsnaz Virani, Letha H. Etzkorn, Sherri Messimer
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

The purpose of our study is to analyze whether the Bansiya and Davis quality models also reflect the ongoing stability of a software design in software developed using a highly iterative or agile process. We performed an empirical study over multiple iterations of various software packages developed using highly iterative or agile methods. We examined several Bansiya and Davis quality factor models (reusability, flexibility, understandability, functionality, extendibility, and effectiveness) over this data set and we compared them to stability metrics. We conclude that the Bansiya and Davis total quality index does indeed reflect stability over the data sets examined.
Facing Imbalanced Classes through Aggregation of Classifiers
Authors: M. Molinara, M. T. Ricamato, F. Tortorella
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Two class classification problems in real world are often characterized by imbalanced classes. This is a serious issue since a classifier trained on such a data distribution typically exhibits a prediction accuracy highly skewed towards the majority class. To improve the quality of the classifier, many approaches have been proposed till now for building artificially balanced training sets. Such methods are mainly based on undersampling the majority class and/or oversampling the minority class. However, both approaches can produce overfitting or underfitting problems for the trained classifier. In this paper we present a method for building a multiple classifier system in which each constituting classifier is trained on a subset of the majority class and on the whole minority class. The approach has been tested on the detection of microcalcifications on digital mammograms. The results obtained confirm the effectiveness of the method.
Building maps for mobile robot navigation using fuzzy classification of ultrasonic range data
Authors: Omar M. Al-Jarrah, Omar Q. Bani-Melhem
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

For a mobile robot to navigate in a completely unknown environment, it has to perceive its environment locally or globally, reason about its perceptions, and act accordingly. This paper presents a method for building environmental maps for mobile robot navigation using fuzzy classification of ultrasonic range data. The paper concentrates on the classification method. A fuzzy classifier is built to classify the ultrasonic data while the robot is exploring its environment. The generated map will be a graph-representation (topological) of the environment in which nodes represent situation areas and edges represent transitions between these areas. The fuzzy classification is compared with self-organizing feature map neural network classifier. It is shown that when using fuzzy classification, the generated nodes in the map are reduced. This will reduce the time to build the path between the start and target positions. Simulation results prove the success of the fuzzy classification in building environmental maps in comparison with neural networks.
The Impact of Electronic Disks on System Architecture
Authors: J. H. Wensley
Venue: Computer (1975)

The availability of mass storage devices with access times several orders of magnitude less than rotating-device memories will have varying impacts on computer system architectures. These effects will range from simple changes such as direct substitution for disks, where significant productivity increases can be easily achieved, through more radical changes where both hardware and software are changed in structure to exploit the potential of these new devices. Such changes include architectures for transaction-based computing, real-time computing with nonresident programs, and more flexible structures for time-shared computers.
A New Algorithm for Computing Correlations
Authors: W. B. Kendall
Venue: IEEE Transactions on Computers (1974)

In this correspondence we present a new algorithm for computing the correlation [mi][/mi]. For applications where the "cost" of a multiplication is greater than that of an addition, the new algorithm is always more computationally efficient than direct evaluation of the correlation, and it is generally more efficient than FFT methods for processing 128 or fewer data points, or for calculating only
The many faces of microprogramming: what started out as a convenience for systems designers may eventually bring computers much better tailored to users' needs
Authors: Robert C. Haavind,  Jr
Venue: ACM SIGMICRO Newsletter (1972)

This is the twentieth anniversary of "microprogramming," a term coined by M. V. Wilkes of Cambridge University, England to describe a method he proposed for a more orderly approach to the design of the control sections of computers. During these twenty years the techniques of microprogramming have served engineers well. For systems designers at IBM it provided a tool to produce the most successful family of computers in history --- the 360's. 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
Improving multi-tier security using redundant authentication
Authors: Jodie P. Boyer, Ragib Hasan, Lars E. Olson, Nikita Borisov, Carl A. Gunter, David Raila
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

Multi-tier web server systems are used in many important contexts and their security is a major cause of concern. Such systems can exploit strategies like least privilege to make lower tiers more secure in the presence of compromised higher tiers. In this paper, we investigate an extension of this technique in which higher tiers are required to provide evidence of the authentication of principals when they make requests of lower tiers. This concept, which we call redundant authentication, enables lower tiers to provide security guarantees that improve significantly over current least privilege strategies. We validate this technique by applying it to a practical Building Automation System (BAS) application, where we explore the use of redundant authentication in conjunction with an authentication proxy to enable interoperation with existing enterprise authentication services.
Kitchen album: concept based on progressive user research
Authors: Agustina Lagomarsino
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

The implementation of interactive technologies in everyday life environments increases day by day. The kitchen, as a working and social space in the home, offers an interesting environment for the implementation of interactive media technologies with an emotional background. This paper introduces an interactive digital application concept which proposes new ways to communicate cooking knowledge. The concept, which was developed on user research basis, helps to shorten distances imposed by time or geography by the collection and reproduction of audio and visual material. Within this paper I will also describe the development process of the idea, which has been based on a stepped conjugation of existing user research methods, which I call progressive user research.
Location-based services
Authors: Iris A. Junglas, Richard T. Watson
Venue: Communications of the ACM (2008)

Evaluating user perceptions of location-tracking and location-awareness services.
Lifetime analysis based on the generalized Birnbaum-Saunders distribution
Authors: Víctor Leiva, Marco Riquelme, N. Balakrishnan, Antonio Sanhueza
Venue: Computational Statistics Data Analysis (2008)

In this paper, we consider a family of generalized Birnbaum-Saunders distributions and present a lifetime analysis based mainly on the hazard function of this model. In addition, we carry out maximum likelihood estimation by using an iterative algorithm, which produces robust estimates. Asymptotic inference is also presented. Next, the quality of the estimation method is examined by means of Monte Carlo simulations. We then provide a practical example to illustrate the obtained results. From this example and based on goodness-of-fit methods, we show that the GBS distribution results in a more appropriate model for modeling fatigue data than other models commonly used to model this type of data. Finally, we estimate the hazard function and the critical point of this function.