bluuebunny/crossref_metadata_2025 huggingface dataset:
Technical writing
Authors: Patterson Diana
Published: April 2007

Some of the success of automated documentation, unavoidably, depends on the final output terminal. All UPPER CASE LETTERS HAVE A TENDANCY TO MAKE BLOCKS OF SOLID TEXT TO BE EXCEEDINGLY DIFFICULT TO READ (AND FULLY JUSTIFIED TEXT MAKES THINGS EVEN WORSE). You want an upper and lower case terminal, clean, even printing, and, probably, the capability to change print faces and paper stock. Not many terminal manufacturers are sensitive to these requirements.
Foundations of documentation
Authors: Kuch T. D. C.
Published: April 2007

There seems to be a lack of published papers dealing with the incidence and causes of errors in data bases, although errors in programs have been frequently studied. If any reader knows of some good references, I would appreciate hearing about them.
Technical writing
Authors: Patterson Diana
Published: April 2007

In the last issue of * I put the meat of a magazine article down on it's final resting place. It was missing a small illustration and some screening. Here is what we hope to have for a final copy:Here is what we have done so far:If you couldn't draw the graph yourself, there are plenty of programs that will print ...s in the appropriate places given xxxs and yyys. All we will do is draw the box around the graph and box in the table.
Foundations of documentation
Authors: Kuch T. D. C.
Published: April 2007

In vol. 2 nr. 1 of this newsletter I recommended a Datamation article by Karl M. Pearson Jr. I wrote him for his current thoughts on computer program documentation, and received the following interesting response:"At SDC, the system described in the articles [*] was used by the Technical Information Center staff to produce a printed software catalog that was published in June 1974. While several people made use of the catalog to locate software items they could take advantage of, most programmers and managers paid little attention to it. However, an updated catalog is scheduled for publication in the coming year.
Techncial writing
Authors: Patterson Diana
Published: April 2007

Like it or don't, the world is going metric. But I think by the end of this article you're going to like it, because the metric system is bringing sanity to the printing and publishing business. If you ever print your documents out on paper rather than computer forms or ever put documents in binders, this change will eventually affect you. If you ever enlarge or reduce your output, diagrams or photographs, you're going to find the change amenable.
Campus computer centers
Authors: Durr Patricia
Published: April 2007

Michigan Technological University has a UNIVAC 1110 2x1 which serves the academic and administrative community. We have approximately 2,000 to 3,000 users in the faculty, staff, and student areas.
Documentation techniques
Authors: Ransier Glenn
Published: April 2007

An Algorithm for Doing System Documentation was the subject of this section last June. The last two steps -- 10 and 11 -- were left off, and promised for a later issue, which turns out to be this one. The first nine steps are repeated in shortened form.
Foundations of documentation
Authors: Kuch T. D. C.
Published: April 2007

Some months ago, I asked for comments on the relationship between standards and documentation. Having received none, I offer some preliminary views of my own.
Technical writing
Authors: Patterson Diana
Published: April 2007

Text editors and formatters are always a subject of interest to those who use them, and horror stores are common subjects of discussion, for example:March 4, 1976In the January, 1976 issue of the SICDOC Newsletter, you noted that there are "hundreds" of text editors and formatters. I am interested in these programs and would like to know the names and references of any you are familiar with or have heard about. Your opinions of their quality would also be appreciated.
HOTDAM
Authors: Berosik Gary
Published: April 2007

Conventional automated (on-line) documentation usually consists of an unstructured or semi-structured collection of manuals, short information sheets, and user guides. Each of these is retrievable as an all or nothing entity.
¡ Technical writer's complaint!
Authors: Madole Bruce
Published: April 2007

As a technical writer in a large computer systems department, I am constantly faced with the task of reading other people's writing. In addition to draft procedures, there is usually parade of technical articles and publication crossing my desk and demanding my attention.
Review of "Reviews Vision, by David Marr" San Franclsco: WH Freeman, 1982
Authors: Craig Donald M.
Published: April 2007

David Marr's Vision is jammed with information about what it means to see, both technically and philosophically; it lucidly reports the last ten years of research into the human visual system from the multi-disciplinary perspective of Marr and his colleagues. Workers in human vision tended to have either a neuro-physiological background (as Marr had), or a psychophysical one. In the early seventies Marr reached the conclusion that such disciplines helped to describe rather than explain the behaviour of neural cells or of subjects. He moved to the MIT artificial intelligence lab in 1973, in the hope that, by trying to build an artificial vision system, the fundamental engineering reasons for the structure of the human visual system could be discovered.
Errurs
Authors: Weinberg Gerald M.
Published: April 2007

This is the first edition of a new feature in *, the Errurs Column. Each issue, we will feature an errur contributed by one of our readers, or taken from the editor's voluminous file of idiocies. What we're looking for is bad examples of documentation, each of which contains a moral for our vast readership.
Days of gloom and despair
Authors: Patterson Diana
Published: April 2007

A Couple of Weeks ago I received a letter from one of Sigdoc's best contributors Asking me if I thought there Was any more to say about tech writing in general and the use of text formatting systems in particular. Enthusiastically I declared "Yes!" I had just returned from that ITCC in dallas where there seemed a never ending stream of panel sessions and slides that proclaimed that there were more tech writers, editors, teachers and illustrators than ever before.
Errurs
Authors: Weinberg Gerald M.
Published: April 2007

Today, dear subject, I will subject you to the subject of heteronyms.
Debugging user
Authors: James Glenna
Published: April 2007

That systems and programs are debugged (often) no one will quibble with. But what about our user manuals? Though we write with the pens of men, angels and miricle minis and produce not clarity, we are damned. How are we to know when we haven't been "perfectly clear"?
Some notes on self
Authors: Gobbi G. , Maiocchi M.
Published: April 2007

The fundamental role played by software documentation is well known, not only as necessary product description, but also as a tool for communication among programmers and as a tool for distribution of know-how.
Documentation standards and their
Authors: Thomas Frank B.
Published: April 2007

Good documentation has always been a problem to data processing centers.
The new features of Fortran 2000
Authors: Reid John
Published: April 2007

The aim of this paper is to summarize the new features in the draft Fortran 2000 standard (J3 2002). We take as our starting point Fortran 95 plus the two official extensions (Cohen 2001, Reid 2001) that have been published as Type 2 Technical Reports. These provide features for1. Allocatable dummy arguments and type components, and2. Support for the five exceptions of the IEEE Floating Point Standard (IEEE 1989) and for other features of this Standard.There is a firm commitment to include the features of these TRs in Fortran 2000, apart from changes that follow from errors and omissions found during implementation. Therefore, these features are not open to comment and are not described here. For an informal description, see chapters 12 and 13 of Metcalf and Reid (1999).Fortran 2000 is a major extension of Fortran 95. This contrasts with Fortran 95, which was a minor extension of Fortran 90. The major changes concei'n the two TR items, object orientation, and interfacing with C. Allocatable arrays are very important for optimization - after all, good execution speed is Fortran's forte. Exception handling is needed to write robust code. Object orientation provides an effective way to separate programming into independent tasks and to build upon existing codes; we describe these features in Section 1. Interfacing with C is needed for access to the all the hardware features and to allow C programmers to call efficient Fortran codes; we describe these features in Section 4. There are also many less major enhancements, described in Sections 2 and 3.
From the editors
Authors: Stafford Tom , Chau Patrick Y. K.
Published: April 2007

Welcome to Data Base 2.0! Things are different, now; it's a new year and a new publication. A new editorial team is in place and we have new financial supporters to support the editorial process. This permits us to undertake initiatives to increase the scope and impact of Data Base. We are promoting new topic coverage and geographical coverage, we have a new scope, and we are building the basis of a new level of impact for this important ACM publication, as part of this new initiative.It's an all-new Data Base, with global editorial coverage and a new online manuscript submission and review system to facilitate global participation by the community of information systems and technology scholars. Visit our new Internet resources at http://the-database.org.I'm Tom Stafford (tstaffor@memphis.edu), Editor-in-Chief, stationed at the logistics hub of the West in Memphis, Tennessee; my Global Co-Editor, Patrick Chau (pchau@business.hku.hk), is stationed at the logistics hub of the East in Hong Kong. Together, with an online review system stationed online at Editorial Manager.com (http://www.editorialmanager.com/SIGMISDB), and citation analysis and impact scoring evaluated by Thompson Scientific, we anticipate greatly increased global presence and visibility with this important publication.In a field where we admittedly do not provide enough premium publication outlets for our scholars, it's time to start building a new premium marquee. That marquee is the new, improved, and ever-popular Data Base for Advances in Information Systems.As we undertake this important new initiative, we owe everything we intend to do to the diligent and successful efforts of Dorothy Leidner and Wynne Chin, who have nurtured and grown the publication thus far - building visibility, maintaining rigor and standards, promoting access and participation. We take what they have built and launch it on a truly global scale with the innovation of global editorship and global editorial access through our online review system.We continue to benefit from the sage advice and superior production capabilities of the prior technical management team, and are thoroughly pleased to announce that Managing Editor Andrew Schwarz and Technical Editor Denny Kramer continue with us through this important evolution in the growth of Data Base. In the interim period of transition to new editorial offices and the online review system, Andrew will continue to field new manuscript submissions via email (aschwarz@lsu.edu), while Denny (denny_kramer@baylor.edu) continues to prepare manuscripts in flow for completion and publication.It's new, it's important, and it's going places, world-wide: the new Data Base. Please join us as we grow!
From the chair
Authors: Sipior Janice C. , Lending Diane , Amoroso Donald L. , Shayo Conrad , Vowels Susan A.
Published: April 2007

Happy New Year! I hope this year brings you health, happiness, and good cheer!Thanks to those of you who attended the "Sixth Annual ACM-SIGMIS Reception," held as an ACM-SIGMIS event prior to the International Conference on Information Systems (ICIS2006) in Milwaukee, WI USA. It was great fun seeing everyone. Please visit ACM-SIGMIS's website at: http://www.acm.org/sigmis to view photos from this event. Mark your calendar now for next year's reception, scheduled for Saturday, December 8, 2007, from 5:30-7:00pm, prior to ICIS2007 to be held in Montreal, Canada, December 9-12, 2007.Just a reminder for this year's CPR2007 conference and Doctoral Consortium:

Conference:
ACM-SIGMIS Computer Personnel Research 2007 Conference

Theme:
"The Global Information Technology Workforce"

When & Where:
April 19-21, 2007, St. Louis, Missouri, USA

Doctoral Consortium:
April 19, 2007

Website:
http://www.sigmis.org

.The beautiful Blue Ridge Mountains of North Carolina, USA is the venue for next year's CPR2008. Please consider sending a submission by the October 2007 deadline. Your participation is welcome!Also, please consider attending the upcoming conferences this year with which we are in-cooperation: Autonomous Infrastructure, Management, and Security (AIMS), http://www.aims2007.org; Business Information Systems (BIS), http://bis.kie.ae.poznan.pl; International Conference on e-Business (ICE-B), http://www.ice-b.org; International Conference on e-Business and Telecommunications (ICETE), http://www.icete.org; and International Conference on Enterprise Information Systems (ICEIS), http://www.iceis.org.As always, thanks for your support of SIGMIS. We encourage your involvement. Please contact any one of us with suggestions or other input.We look forward to seeing you at ACM-SIGMIS CPR'07!
An experimental investigation of turnover intentions among new entrants in it
Authors: Agarwal Ritu , Ferratt Thomas W. , De Prabuddha
Published: April 2007

Although much research has focused on factors driving the turnover behaviors of information technology (IT) professionals once they are in an employment relationship, little is known about their ex ante intentions to stay when embarking on a new employment relationship. The present study investigates the effects of individual and situational factors on the turnover intentions of new entrants into the IT workforce. Arguably, the IT revolution of the past decade, both at its peak as well as its decline, has changed the expectations and values of this population of workers considerably. Adopting an interactionist perspective, we examine the interaction between individual preferences for organizational risk and variety, and the level of entrepreneurial risk inherent in the business model of a given employer together with the amount of variety that IT work with that employer offers. The posited relationships are tested in a policy capturing experiment with graduating information systems majors as subjects. The results provide support for the interactionist perspective, while at the same time questioning its basic premise.
A review of information security issues and respective research contributions
Authors: Siponen Mikko T. , Oinas-Kukkonen Harri
Published: April 2007

This paper identifies four security issues (access to Information Systems, secure communication, security management, development of secure Information Systems), and examines the extent to which these security issues have been addressed by existing research efforts. Research contributions in relation to these four security issues are analyzed from three viewpoints: a meta-model for information systems, the research approaches used, and the reference disciplines used. Our survey reveals that most information security research has focused on the technical context, and on issues of access to IS and secure communication. The corresponding security issues have been resolved by using mathematical approaches as a research approach. The reference disciplines most commonly reflected have been mathematics, including philosophical logic. Based on this analysis, we suggest new directions for studying information security from an information systems viewpoint, with respect to research methodology and research questions. Empirical studies in relation to the issues of security management and the development of secure IS, based on suitable reference theories (e.g., psychology, sociology, semiotics, and philosophy), are particularly necessary.
HDLQ
Authors: Ottavi Marco , Schiano Luca , Lombardi Fabrizio , Tougaw Douglas
Published: April 2007

Emerging technologies have attracted a substantial interest in overcoming the physical limitations of CMOS as projected at the end of the Technology Roadmap; among these technologies, quantum-dot cellular automata (QCA) relies on different and novel paradigms to implement dense, low power circuits and systems for high-performance computing. As applicable to existing technologies, a hierarchical process can be utilized to facilitate the design of QCA circuits. Tools and methodologies both at system and physical levels are required to support all design phases. This article presents an HDL model to describe QCA “devices” (also referred elsewhere in the technical literature as building blocks, i.e., majority voter, inverter, wire, crossover) and facilitate the evaluation of their design. This tool, referred to as HDLQ, allows a designer to verify the logic characteristics of a QCA system, while supporting within a design environment different operational mechanisms (such as fault injection) and the unique features of QCA (such as bidirectionality and timing/clocking partitioning). The applicability of this design environment to various memory circuits for logic and timing verification is presented in detail. Various defective conditions for kinks due to thermodynamic effects and permanent faults due to manufacturing defects are considered for injection.
Timing on computers
Authors: Gentleman W. M. , Wichmann B. A.
Published: April 2007

Most computers today provide some form of clock which can be read by software. The purpose of this note is to illustrate why in many existing systems, the facilities offered are inadequate for ordinary programmers. Proposals are made for changes in both hardware and software to remedy these deficiencies.
Architectural assistance to software debugging aids
Authors: Schank Karl
Published: April 2007

It has been observed [1] that 45 to 50% of programming effort is spent in debugging, checkout and testing, yet the architecture of most modern computer systems does little if anything to facilitate ease of debugging. In most batch systems the programmer is sufficiently removed from the execution of his program as to be severely handicapped in diagnosing errors. There is only so much information that can be easily obtained from a voluminous coredump, for instance. Even programmers on large timesharing systems have available at most an interactive software debugging package which operates through a combination of insertions and replacements of object code and interpretation (rather than execution) of machine code. This can get to be quite inefficient when carried to the extreme and often is useful only if the program has been processed by a special compiler.
Instruction looping, an extension to conditional execution
Authors: Ulmann B.
Published: April 2007

The following article describes an easy to implement but very powerful extension to simple conditional execution based program flow control as used for example in the ARM RISC processors and others.
International workshop performance evaluation - origins and directions
Authors: Haring Günter , Lindemann Christoph , Reiser Martin
Published: April 2007

Performance Evaluation is a discipline of Computer Science for some thirty years. It seems time to take stock of what we were doing. That is, provide answers to the following questions:• What are its scientific contributions?• What is its relevance in industry and business?• What is its standing in academia?• Where is the field headed?• What are its success stories and failures?• What are its current burning questions?
Reducing stack usage in Java bytecode execution
Authors: Munsil Wes , Wang Chia-Jiu
Published: April 2007

For many years, the Tomasulo method of dynamically scheduling instructions for execution in a load/store processor has been known and used. This paper presents an adaptation of the Tomasulo method to a stack-based processor architecture, and illustrates its use in a software simulator of a subset of the Java Virtual Machine. Experimental results show that the adapted Tomasulo method reduces stack usage, in some cases eliminating it altogether. This method should be of interest to computer architects and those involved in the implementation and use of the Java programming language.
Internet nuggets
Authors: Thorson Mark
Published: April 2007

This column consists of selected traffic from the
comp.arch
newsgroup, a forum for discussion of computer architecture on Internet --- an international computer network.As always, the opinions expressed in this column are the personal views of the authors, and do not necessarily represent the institutions to which they are affiliated.Text which sets the context of a message appears in italics; this is usually text the author has quoted from earlier messages. The codelike expressions below the authors' names are their addresses on Internet.
A canonic interpretive program form for measuring "ideal" HLL architectures
Authors: Flynn M. J.
Published: April 2007

Over the past several years our group has become increasingly interested in the notion of an "ideal" machine. Ideal with respect to some specified higher level language (HLL) environment. Initially, much of the focus of the work was on traditional machines: trying to identify and factor out architectural instructions and artifacts in programs from functional instructions. For example, the existence of load or store accumulator instructions in a program representation are largely architectural since they specify a movement among the storage resources of a system rather than a movement required in the original source program. We found it useful at the time to define three types of instructions:(1) M-type instructions or memory partition movement instructions such as the aforementioned load and store instructions. These instructions move data within the storage hierarchy.(2) P-instructions or procedural instructions performing operations associated with instruction sequencing: branch, compare, test, etc.(3) F-instructions are the functional instructions which actually transform a datum. These would include arithmetic operations as well as logical and shifting operations.
A question of semantics
Authors: Denning Peter J.
Published: April 2007

I have been following with some interest the "controversy" over stack architecture of computers. Jack Lipovski [CAN, February 1978] countered Forest Baskett's suggestion [CAN, December 1977] that register machines are the wave of the future. J. Keedy [CAN, February 1978] argues against G. Myers case against [CAN, August 1977].
A comparison of the effect of branch prediction on multithreaded and scalar architectures
Authors: Golla Prasad N. , Lin Eric C.
Published: April 2007

Speculative instructions execution requires dynamic branch predictors to increase the performance of a processor by executing from predicted branch target routines. Conventional Scalar architectures such as the Superscalar or Multiscalar architecture executes from a single stream, while a Multithreaded architecture executes from multiple streams at a time. Several aggressive branch predictors have been proposed with high prediction accuracies. Unfortunately, none of the branch predictors can provide 100% accuracy. Therefore, there is an inherent limitation on speculative execution in real implementation. In this paper, we show that Multithreaded architecture is a better candidate for utilizing speculative execution than Scalar architectures. Generally the branch prediction performance degradation is compounded for larger window sizes on Scalar architectures, while for a Multithreaded architecture, by increasing the number of executing threads, we could sustain a higher performance for a large aggregated speculative window size. Hence, heavier workloads may increase performance and utilization for Multithreaded architectures. We present analytical and simulation results to support our argument.
From COURSEWRITER to APL to ???
Authors: Lower Stephen K.
Published: April 2007

One of the advantages of small size is presumably the ability to rapidly shift position as the need becomes apparent -- and, in the field of computer-assisted instruction, to evolve flexibly with the state-of-the-art without being burdened by the inertia of long-established and deeply entrenched prior practice. If this is true, then Simon Fraser's CAI effort, certainly one of the smaller ones in terms of people, would seem to be exploiting its size to the utmost.
Student performance in an objectives-based course using computer-assisted instruction
Authors: Lower Stephen K.
Published: April 2007

Numerous attempts have been made to assess the "effectiveness" of innovative teaching techniques such as audio-tutorial methods and computer-assisted instruction (CAI). The results of such studies turn out to be quite variable, sometimes showing improved student performance, and sometimes not. One reason for this rather disturbing variance may arise from the common practice of comparing the performance of two groups of students differing only in that one group is exposed to the new technique and the other is not. Many instructional media, particularly those that emphasize individual study, cannot be exploited to their maximum effectiveness when they are used in conjunction with an otherwise "conventional" lecture-oriented course format.
Dazzle dart
Authors: Abelson Harold
Published: April 2007

One of the striking things about the current crop of "educational computer games" is the generally tame and above all stingy way in which they use computational resources. Computer programs select random numbers, display game boards, and prompt players to guess secret words or numbers. In almost every case these things can be done, not to mention done better, without using a computer at all. It is short-sighted and wasteful to have powerful machines simply replace spinners, game boards, and flash cards.
A computer mathematics course for secondary school teachers
Authors: Bevis Jean H.
Published: April 2007

This popular course has been taught by the Department of Mathematics at Georgia State University for the last several years. The course is designed for students in the Master of Arts for Teachers and Master of Education programs. Most of these students start teaching mathematics at the secondary level before entering the program.
Copyright and CAI
Authors: Kearsley G. P. , Hunka S.
Published: April 2007

The issue of copyright law as it applies to the domain of Computer Assisted Instruction (CAI) is explored. The application of copyright laws to CAI is not a simple matter of extending traditional literary practices because of the legal complications introduced by the use of computers to store and reproduce materials. In addition, CAI courseware poses some new problems for the definitions of educational usage. Some precedent CAI copyright arrangements are briefly described. The implications of copyright law for CAI facilities, academic institutions, and the evolution of CAI itself, are discussed.
Ansi study group working paper
Authors: Puk Richard F.
Published: April 2007

In considering the feasibility of developing a standard in computer graphics, it is necessary that the computer graphics state-of-the-art as well as past and present standardization activities in the area of computer graphics be thoroughly understood. This document reviews the history of computer graphics and quickly surveys the developing technology before presenting computer graphics standardization activities to date.
Design automation and engineering organization structures
Authors: Segal Richard
Published: April 2007

Design automation over the years has taken many forms. Engineering projects of every description have been targeted by computer specialists as systems which might benefit from automation. Today, several major firms are marketing CAD/CAM systems in a big way. Electrical design workstations and mechanical part workstations and data bases have been most successful and these companies are continually refining and improving their systems looking towards the future. Though there are many consulting firms available to assist in the automation of an interested engineering organization, many project managers still resist the automation tide. This paper is an exploration of several areas which will need to be addressed in the years to come if automation is to be successfully applied to even the most complex of engineering undertakings. The exploration is facilitated through the elucidation of important structures which appear in engineering organizations. The hope is that through the understanding of these implicit structures, computational systems can be built which reflect these structures and thereby provide additional project coherence. The primary areas affected are management, verification, inter-module communication and integration. This work is continuing under the leadership of Dr. F.B. Thompson at the California Institute of Technology.
Symbol-mapping
Authors: Erman Lee , McDermott Drew
Published: April 2007

The technical topic for this issue is symbol-mapping, introduced in the April, 1975 issue (No. 51, pp. 4-5) by Drew McDermott.
Automation of investment analysis
Authors: Felsen Jerry
Published: April 2007

This brief report outlines some recent results of our research program involving applications of cybernetic concepts and artificial intelligence techniques to automation of business problem solving. Specifically, it reports an application of generalized perceptron-type pattern recognition techniques to (at least partial) automation of investment decision making. As man-machine systems, we have implemented investment decision systems programming both, stock market timing and investment selection. They were tested in actual investment analysis, and their performance was then gradually improved with the aid of machine learning algorithms. The experimental results indicate that with such techniques investment performance can be improved.
There's always room at the top or how frames gave my life meaning
Authors: Yolks Warwick
Published: April 2007

Two convergent strands in recent research have shown the undoubted importance for language understanding of some formal representation of our everyday knowledge of normal sequences of events: "frames" (Minsky 1974) and Charniak (1975) on the one hand, and "scripts" (Abelson 1973) and (Schank and Abelson 1975) on the other.
Computer aided design and design automation in Europe
Authors: Magnuson Waldo G.
Published: April 2007

This document is issued primarily for the informtion of U.S. Government scientific personnel and contractors. It is not considered part of the scientific literature and should not be cited as such.
Socio-technical defense against voice spamming
Authors: Kolan Prakash , Dantu Ram
Published: April 2007

Voice over IP (VoIP) is a key enabling technology for migration of circuit-switched PSTN (Public Switched Telephone Network) architectures to packet-based networks. One problem of the present VoIP networks is filtering spam calls referred to as SPIT (Spam over Internet Telephony). Unlike spam in e-mail systems, VoIP spam calls have to be identified in real time. Many of the techniques devised for e-mail spam detection rely upon content analysis, and in the case of VoIP, it is too late to analyze the content (voice) as the user would have already attended the call. Therefore, the real challenge is to block a spam call before the telephone rings. In addition, we believe it is imperative that spam filters integrate human behavioral aspects to gauge the legitimacy of voice calls. We know that, when it comes to receiving or rejecting a voice call, people use the social meaning of trust, reputation, friendship of the calling party and their own mood. In this article, we describe a multi-stage, adaptive spam filter based on presence (location, mood, time), trust, and reputation to detect spam in voice calls. In particular, we describe a closed-loop feedback control between different stages to decide whether an incoming call is spam. We further propose formalism for voice-specific trust and reputation analysis. We base this formal model on a human intuitive behavior for detecting spam based on the called party's direct and indirect relationships with the calling party. No VoIP corpus is available for testing the detection mechanism. Therefore, for verifying the detection accuracy, we used a laboratory setup of several soft-phones, real IP phones and a commercial-grade proxy server that receives and processes incoming calls. We experimentally validated the proposed filtering mechanisms by simulating spam calls and measured the filter's accuracy by applying the trust and reputation formalism. We observed that, while the filter blocks a second spam call from a spammer calling from the same end IP host and domain, the filter needs only a maximum of three calls---even in the case when spammer moves to a new host and domain. Finally, we present a detailed sensitivity analysis for examining the influence of parameters such as spam volume and network size on the filter's accuracy.
A performance analysis method for autonomic computing systems
Authors: Litoiu Marin
Published: April 2007

In an
autonomic computing
system, an autonomic manager makes tuning, load balancing, or provisioning decisions based on a predictive model of the system. This article investigates performance analysis techniques used by the autonomic manager. It looks at the complexity of the workloads and presents algorithms for computing the bounds of performance metrics for distributed systems under
asymptotic
and
nonasymptotic
conditions, that is, with saturated and nonsaturated resources. The techniques used are hybrid in nature, making use of performance evaluation and linear and nonlinear programming models. The workloads are characterized by the
workload intensity
, which represents the total number of users in the system, and by the
workload mixes
, which depict the number of users in each class of service. The results presented in this article can be applied to distributed transactional systems. Such systems serve a large number of users with many classes of services and can thus be considered as representative of a large class of autonomic computing systems.
Formulation of transportation problems
Authors: Haverly C. A.
Published: April 2007

Algorithm developers commonly work in terms of equations and inequalities or matrices. Much of the literature is expressed in these terms. However, formulators commonly formulate models in terms of activities and constraints on the activities.
Integer programming
Authors: Haverly C. A.
Published: April 2007

Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values such as 0, 1, 2, 3, or 4.
Solving large scale mixed integer programs of the fixed cost type
Authors: Martin Glenn T.
Published: April 2007

This algorithm arose out of the necessity to handle setup effects in production scheduling, hence - inevitably - the acronym, "setup algorithm". However, the technique can be applied to a number of prevalent problems such as (certain) capital budgeting, media selection, plant/warehouse location, seasonal manpower leveling, lockbox, and others. The general model employs zero-one fixed cost (or setup) variables each of which dominates a set of continuous variables. Thus, if a fixed cost variable is at value one, the sum of the dominated set may take on any value up to a stated maximum. On the other hand, if the fixed cost variable is at value zero, all the dominated set is constrained to zero.
Some tactics for 0-1 programming
Authors: Greenberg Harvey J. , Kalan James E.
Published: April 2007

This paper describes several tactics (including batch branching) for employing a directed tree search strategy to find a binary vector slated to optimize a linear function. Certain tactics are especially useful when interfacing with an LP system to guide the tree search.
An "Out-of-Kilter" network tutorial
Authors: Swanson H. S. , Woolsey R. E. D.
Published: April 2007

Network flow algorithms have been developed to handle a special class of linear programming problems. These problems may each be described by a network whose links carry flow. Network algorithms take advantage of this special structure to produce an optimal solution much more quickly, with less storage required, and with virtually no round off error in comparison with general linear programming codes. The objective of this paper is to introduce the reader to the basic ideas involved in formulating a network problem, and to explain in a non-technical manner what the "out-of-kilter" network algorithm (1) does. This algorithm is very general and extremely efficient in solving network flow cost problems (as opposed to CPM, PERT, and GERT type networks).
Symposium on nonlinear programming at the George Washington University
Authors: Haverly Larry
Published: April 2007

A Symposium on Nonlinear Programming was held at The George Washington University on 14-16 March 1973. It was sponsored by the Mathematical Programming Society under the auspices of the Office of Naval Research and the university's Department of Operations Research. The conference was organized and conducted by Anthony V. Fiacco (Program Chairman), Garth P. McCormick (Arrangements Chairman) and James E. Falk (Publicity Chairman).
A commentary on the "New Approach to LP"
Authors: White William W.
Published: April 2007

Probably the most eventful occurrence at the recent Mathematical Programming Symposium at Stanford was Dr. Hugo Scolnik's presentation of his New Approach to Linear Programming. This approach rapidly became the subject of much discussion, and a somewhat hastily written version (and later an addendum) of the presentation was distributed in response to the general clamor (this material was reproduced in the last issue of this Newsletter). By the end of the symposium the odds seemed to have shifted to the viewpoint that Scolnik may indeed have a major new result.
APOSS
Authors: Grigoriadis Michael
Published: April 2007

Order relations are constructed in the solution space of a linear 0-1 program and they are used to obtain information about the problem (infeasibility, forced values for certain variables, equality or non-equality of certain pairs of variables, etc.). On this basis an algorithm is described for solving 0-1 programs. Good computational experience is reported with the algorithm.
Code development and computation testing on network problems
Authors: Glover Fred , Klingman Darwin
Published: April 2007

Since 1970 we have been jointly working with systems analysts in order to develop new techniques which are computationally efficient for solving network problems. Our first step in this direction was to elaborate on Johnson's "triple-label method" [9] by providing a method for characterizing successive basis trees with minimal relabeling. This procedure, which is called the augmented predecessor index (API) method [5], additionally indicates the most efficient way to co-ordinate the activities of finding the representation of the come-in arc (basis equivalent path), pricing-out the basis, and updating the basis labels. The API method has been a major contributor to the improvements in the computational efficiency of solution algorithms. Its use was a factor underlying the efficiency attained by the special purpose primal simplex transportation code of Glover, Karney, and Klingman [6]. In addition, the procedure was incorporated into the Srinivasan -- Thompson accelerated primal transportation code [14] and succeeded in cutting the solution times of that algorithm by more than half.
A mixed integer programming formulation for a textile operation
Authors: Nolting James A.
Published: April 2007

This model was developed for the Synthetic Fabrics Division of the Standard Oil Company of Indiana. They make woven polypropylene fabrics to be used for carpet backing and industrial bags. The mill is in the enviable position of being able to operate at capacity, and orders for this product must normally be made a couple of months in advance.
A note of effluent charges
Authors: Woolsey R. E. D. , Swanson H. S.
Published: April 2007

Ferrar in[1] discussed some of the problems in the implementation of an effluent taxation structure. Two of the problems discussed in his paper were that (1) damage from effluents is very difficult to quantify, and (2) often the offenders have little motivation to clean up the effluent at all, much less give "honest" answers to questions for necessary data.
Minimum-length connection networks
Authors: Hart W. D.
Published: April 2007

These notes were prompted by reading in the SIGMAP Newsletter for November 1973 the article on Minimum-Length Network problems by J. Soukup and W. F. Chow.
Educational series #5
Authors: Salkin Harvey M.
Published: April 2007

Integer Programming problems can be solved by a variety of methods. These include:Implicit EnumerationBranch and BoundCutting PlanesPartitioningGroup Theory
Curve fitting with linear programming
Authors: Swanson H. , Woolsey R. E. D.
Published: April 2007

The classical problem of "fitting" a curve to a set of data is as follows: given a set of N data points (x
j
, y
j
) j = l,..., N, find a value for "m" (slope) and "b" (Y-intercept) such that the curve y = mx+b "best" fits the data. If each of the N data points lies on the curve y = mx+b (i.e. y = mx
j
+b = y
j
j = l,..., N), there is no "error". Otherwise, an "error" is introduced (by choosing m and b) when y = mx
j
+b does not equal y
j
. Thus "m" and "b" must be chosen such that the
sum of errors in estimation or prediction
(using the curve y = mx+b) is minimized.
New methods in linear programming
Authors: Hatfield Gordon B.
Published: April 2007

Linear programming (LP) is an area of applied mathematics that is concerned with the minimization (or maximization) of a real-valued linear function on a convex polyhedron. Since the underlying theory is relatively straightforward, the history of the field is dated by the development of algorithms for solving LP problems. Thus the first important contribution was the simplex method developed in 1974 by George Dantzig (4, p. 15). The approach taken by Dantzig was to transform the inequality constraints into a system of equations with sign-restricted variables. This permitted pivoting methods, for solving systems of equations, to be used in linear programming. Thus the simplex method is a set of pivoting rules designed to maximize a linear function constrained by a set of linear equations. Geometrically it can be viewed as an adjacent extreme point method that finds the maximum through an iterative process of implicitly enumerating basic feasible solutions.
One-dimensional problems in unconstrained signomial programming
Authors: Mancini Louis J.
Published: April 2007

One-dimensional problems arise in both primal and dual signomial programs. Primal problems are of interest since many multidimensional search procedures involve one-dimensional searches. Dual problems occur naturally since many engineering design problems can be expressed as signomial programs with a single degree of difficulty. This paper applies an interval arithmetic version of Newton's method to one-dimensional unconstrained problems in signomial programming. The interval arithmetic method is guaranteed to generate all the stationary points.
Conference on numerical methods for constrained optimization
Authors: Grant J. A.
Published: April 2007

This conference, organized jointly by the National Physical Laboratory and the Institute of Mathematics and Its Applications, was a sequel to the one on unconstrained optimization held in January 1971. The intention was that the papers should all be expository in nature, providing a broad survey of fundamental and useful techniques. In spite of the extra constraints imposed by the Emergency Power Regulations (the proceedings of the first day being held in an atmosphere of increasing gloom due to the fact that lights were not permitted at N.P.L. that day) the aim of the Conference was achieved. The standard of the papers was unusually high and clearly much effort had been taken, both collectively and individually; one small, but useful, indication being the use of a common notation. The major criticism that could be leveled would be to do with the amount of material covered in some of the sessions making it a very intensive course indeed, and leading, perhaps, to some feeling of mental indigestion. Fortunately, pre- or post-prints of most of the talks were available or promised, and the complete proceedings are to be published.
Experiences using the NETGEN program
Authors: Ford Clyde W.
Published: April 2007

NETGEN, a program for generating network problems has been described in recent issues of the Journal of Management Science and the SIGMAP Newsletter. NETGEN's authors, Messrs. D. Klingman A. Napier and J. Stutz, described NETGEN as a general purpose code for "generating a variety of feasible network problems . . . capacitated and uncapacitated transportation and minimum cost flow network problems". Furthermore, say the authors, "researchers can generate identical networks using this code. . .". While this description would seem to reveal a potentially valuable tool for scientists working in the field of network problems, this researcher has encountered several difficulties in utilizing the NETGEN program.
More remarks on Scolnik's approach to linear programming
Authors: Gay David M.
Published: April 2007

This report briefly discusses certain points in Hugo Scolnik's letter (Spring 1974) to the SIGMAP membership, then examines whether superfluous constraints are responsible for the difficulties in Scolnik's approach to linear programming, and finally discusses possible starting heuristics, based on Scolnik's approach, for the simplex algorithm.
Interactive linear programming as a learning tool in a graduate business school environment
Authors: Surkis Julius
Published: April 2007

In introductory Operations Research courses that one encounters in interdisciplinary programs, or in the quantitative techniques courses in Business Schools, a significant amount of time is devoted to the development as well as the computational mechanics of Linear Programming. The average student whose undergraduate background is non-quantitative usually gets lost in the arithmetic operations of pivoting. As a result, the essentials of the simplex method are obscured. An alternative is to use "canned" linear programming codes or routines. This is quite unsatisfactory since all that the student does is punch or type the data in and the results are spewed out. There is no feel for what and how one proceeds to a solution, if a solution should exist.
Operations research and informatics in Hungary
Authors: Orden Alex
Published: April 2007

A National Science Foundation program in support of scientific cooperation with several countries in Eastern Europe gave me an opportunity to be in Hungary for two weeks in September (1975) in order to meet and exchange ideas with people in O. R. and Informatics. I should like to summarize my impressions (Section 1), and describe some of the specific activities and objectives of organizations and educational institutions which I visited (Sections 2-4).
Centralization and decentralization of decision-making in transportation networks
Authors: PINOCHET M. R.
Published: April 2007

The research reported in this paper is part of the author's Ph. D. thesis at The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark under the direction of Professor Arne Jensen.