bluuebunny/crossref_metadata_2025 huggingface dataset:
Interactive simulation with GASP IV on a minicomputer
Authors: Fox Mark A. , Pritsker A. Alan B.
Published: January 2007

In this paper, the implementation of an interactive version of GASP IV, a FORTRAN-based discrete/continuous simulation language (1,2,3) is described. Interactive GASP IV was implemented on a General Automation SPC 16/65 mini-computer configured with 16K words of core memory and operating under the control of a disk based operating system (4). All features of GASP IV are included in the interactive version. A list of the subprograms of GASP IV is presented in Figure 1 (5). In addition, four forms of real-time man-computer interaction have been designed into Interactive GASP IV:1) online presentation of simulated system status on requests through the use of clearly formatted reports and plots;2) free formatted online data input of GASP variables and model parameters;3) programmed decision events requiring online responses as part of the discrete event structure; and4) user intervention in an executing program through keyboard interrupts.
Process-oriented simulation languages
Authors: Saydam Tuncay
Published: January 2007

This article presents a brief general discussion of simulation languages followed by a more detailed description of some the important important features of process-oriented languages. Event oriented languages and some of their properties are briefly covered. Essential elements of process-oriented languages are described and desired features are elaborated. A need for a powerful, complex, yet easy to use process-oriented simulation language is emphasized.
Randomness is nonsense
Authors: Hammer Preston C.
Published: January 2007

There exists no known random sequence since each test for randomness rejects sequences generatable "at random" and hence any sequence accepted on such a basis is from a stratified space and is not random. A property (randomness) of a sequence which disappears on testing is not a property of the sequence. Hence there is either no random sequence or all sequence are random. This situation is not avoidable.
Randomness is a belief
Authors: Koppelaar Henk , Konst Leo
Published: January 2007

In "Randomness is Nonsense," Dr. Preston C. Hammer argues that a property (randomness) of a sequence which disappears on testing is not a property of the sequence. We feel randomness to be a matter of belief, which may be explained as follows:In observing a series of numbers one may view them to behave at random or totally predictable. The latter view is based on the fact that every number obeys laws of number theory and is based on the belief that if time and money are available to simulate the series of numbers we would be able to precisely predict the behavior of the series (for instance, via a nonlinear congruential method). So both views are a matter of belief.
Uniform random numbers in APL
Authors: Franta William R.
Published: January 2007

In the article by R. Wheeler, the author laments the integer nature of the APL operator? when faced with the need to construct a generator which produces random numbers uniformly distributed on (0, 1). The difficulty arises in that the definition specifies that
? X
returns a random integer from 1 to X inclusive. It is indeed unfortunate, since in many ways APL is ideally suited to Monte Carlo experiments. Recently when designing and implementing an APL processor for the CDC 6600, the deficiency was clearly recognized. Under such conditions three possibilities exist in choosing a course of action, namely: (1) the deficiency can be ignored, (2) the operator definition can be altered, and (3) the operator definition can be extended. The design effort dictated that the processor be consistent (in every conceivable way) with the specifications given in [2] thus disallowing (2). This is important so that APL remains APL rather than a series of dialects all labeled APL. The only possible route for emmendation of the deficiency that remains, therefore, is (3).
A random number generator
Authors: Werner Bernard
Published: January 2007

In looking through the two FORTRAN routines which Bernard Werner submitted, I noted that he had embedded a Call statement for a routine, TADT. A copy of that routine in assembly language is included below. This is a macro often found in most IBM installations. If the system does not have the macro, then it can be added for use with the routines through normal program linkage.
A comparison of clock pulse and event algorithms for simulation of traffic flow
Authors: Ho Chung-Man , Gentle James E.
Published: January 2007

The clock pulse and event algorithms are compared for efficiency at various activity levels of a simulation of traffic flow. For low levels of system activity the event algorithm is more efficient (in terms of ratio of real time to similar time). As system activity is raised the increase in the relative efficiency of the clock pulse algorithm is studied empirically.
Some test results on the SIMSCRIPT II. 5 and SIMPL/1 pseudorandom number generators
Authors: Fishman George S.
Published: January 2007

This paper presents results of applying the runs up and down test, the chi-square goodness-of-fit test and the serial test to streams of pseudo-random number generators implemented in the IBM version of SIMSCRIPT II.5, in SIMPL/1 and using their default seeds. Although this limited testing prevents general conclusions, the results presented here do identify several areas of concern. Because of the limited publication of such test information in the learned literature, it is regrettably not possible to offer a completely acceptable method of removing these concerns.
The journal of irreproducible results
Authors: HURWITZ JACOB A. , QUIRK DANIEL A.
Published: January 2007

"Statistical significance," writes William L. Hays, "is a statement about conditional probability, nothing else. It does not guarantee that something important, or even meaningful, has been found." Hays, of course, is only one of many who have bemoaned this glaring shortcoming of conventional statistical tests. Given the increasing number of research reports vying for the attention of any serious scholar, surely the time has come for statistics which will aid us in ascertaining the importance and meaningfulness of our findings. The purpose of this paper is to provide such statistics.
Simulation as an alternative to linear programming
Authors: Solomon Susan L.
Published: January 2007

It is commonly accepted that general classes of problems are best solved using particular techniques. For example, critical path scheduling problems can often be formulated for solution by linear programming, but this approach would not recommend itself for cost reasons to the vast majority of those having access to a PERT or CPM heuristic package. Likewise, the classic product mix or blending problem which pervades the end-of-chapter exercises following a discussion of linear programming is assumed to be "best" solved using graphical methods or the Simplex algorithm. Simulation might offer a reasonable alternative solution vehicle in many circumstances like these, yet some operations research analysts tend to consider its use only "when all else fails". That is, simulation is the technique of last resort.
Working capital decisions
Authors: de Lugo Fernando Alvarez , Roach William L.
Published: January 2007

One of the first models for short-term financing decisions was constructed by A. A. Robicheck, D. Teichroew, and J. M. Jones. Their approach was to use a first order autoregressive process for generating monthly sales. The sales process in conjunction with various ordering rules, credit terms, etc., drives the accounting model of the firm. Various strategies for short term financing (mixes of installment financing, commercial paper and bank borrowing) are implemented, and the distribution of financing costs is tabulated for the various strategies.
A comparison of some discrete event simulation languages
Authors: Leeming A. M. C.
Published: January 2007

Discrete event simulation is now a widely used tool to aid the decision maker faced with the need to investigate the effect of changes on dynamic real-time systems. It is used in those situations which are not susceptible to analytic solutions and where the only alternative to trying out the changes on the live system is to build a model and try the changes on the model. This paper is concerned with the evaluation of three languages which have been developed to enable the model builder to represent a discrete event system on a computer and hence simulate a system. These languages are GPSS, ECSL and SIMULA 67. See refs. 1,2,3.
Application of fast-time discrete simulation techniques in evaluating aircraft collision avoidance algorithms
Authors: Billmann Barry R. , Spracklin Darrell , Thomas Jacob
Published: January 2007

This paper describes a digital discrete simulation system which is used as a test bed to analyze and validate Aircraft Separation Assurance (ASA) algorithms at the Federal Aviation Administration (FAA) Technical Center in Pomona, New Jersey. This dynamic interactive system, the Fast-Time Encounter Generator (FTEG), provides special computer simulation capabilities required to support the evaluation of the Active Beacon Collision Avoidance System (BCAS). As part of the overall BCAS project, the FAA Technical Center is utilizing the FTEG to investigate the performance of the collision avoidance logic. This use and some of the results of the investigations will be discussed. Other uses of the FTEG will also be presented.
Simulation of a computer communication network with GPSS & SIMSCRIPT
Authors: Kirmes H. , Kreutzer W. , Niedereichholz J. , Wentzel C.
Published: January 2007

The results and experiences of a simulation case-study conducted in a seminar for advanced students of applied computer science are reported.A simulation model of a hypothetical teleprocessing network linking a number of universities to a central computer facility was programmed in various versions by 2 groups of students, using the GPSS1100 and SIMSCRIPT II.5 simulation programming languages.After a brief description of the environment and the problem definitions, the basic modelling philosophies of both approaches are contrasted and compared. The simulation results show a surprising similarity. This must, however, at least in part be attributed to the relative "courseness" of the problem situation. Both models arrived at the "best" line-configuration for the data transmission network. The utilization-figures for single lines do not differ by more than 1%.A comparison of the computational resources used shows a marked difference in favour of the SIMSCRIPT models.Various conceptual and implementational problems faced by the programming groups are summarized and discussed.The report closes with the observation that the advantages and shortcomings experienced by using these 2 different modelling approaches and languages can be generalized and are certainly representative and inevitable reflections of basic trade-offs between user-efficiency & conceptual congruence on the one, and processor-efficiency, flexibility & representational power on the other hand.
A Monte Carlo approach for the solution of the simple quadratic and cubic self-avoiding random walk
Authors: Myers Buddy L. , Enrick Norbert L. , Redmond Richard T. , Lindgren John H.
Published: January 2007

A procedure for virtually memory-free Monte-Carlo simulation of the self-avoiding random walk (SAW) in a two-dimensional network and in a simple cubic lattice has been developed. It is highly efficient in yielding values of the intrachain meansquare end-to-end distance <r
2
n
> for chains up to n = 1000 and n = 400 steps, for the two and three-dimensional cases respectively. The number N of walks per each chain of n steps involved n = 500 to N = 3000.Accessing a medium-sized computer via a portable terminal, it was possible to obtain values for n up to 21, with N up to 1000, in minutes, and to obtain values for n up to 400 and 1000 with N up to 300 in approximately an hour of computing time.The principal finding is that for <r
2
n
> = an
γ
, the value of the exponent remains stable at approximately 6/5, consistent with the results of prior work involving complete enumeration for n up to 16 and n up to 10 in the two-dimensional and three-dimensional cases. No comparative data are available for higher levels of n because of the time constraints of memory-dependent computer programs.
The Wenstøp language
Authors: Koppelaar Henk
Published: January 2007

This paper deals with a new kind of modelling social processes: linguistic modelling. The new method makes use of linguistic variables and linguistic causal relationships instead of numerical variables and relations which are usual in social systems modelling and simulation.
A GPSS problem and solution
Authors: Brown Theodore
Published: January 2007

One of the reasons I enjoyed Schriber's, "Simulation Using GPSS" so much when I first read it was that it contains short examples of non-trival language usage. I appreciated the way the language blocks were made use of. I felt I learned alot on how to really use the language. This note is written in this vain. It is based on a real modelling problem that was presented to me. In this note I have only taken those aspects of the problem that show the structure of the GPSS program that I wish to emphasis. Think about how you might solve it.
Interactive modeling and simulation of transaction flow or network models using the ADA simulation support environment
Authors: Adelsberger Heimo H.
Published: January 2007

The Ada Simulation Support Environment (ASSE) is a software system, with the purpose to support the development and maintenance of simulation models written in Ada throughout their life cycle. We describe here the transaction flow or network part of the ASSE, which allows to build models like in GPSS or SLAM. Our view of such models is slightly different from that of the above mentioned languages, which is demonstrated in detail by the server/resource process. The design stres ses modular top-down development using submodels. Models can be developed and tested interactively.
A computational model of evolution
Authors: Rising John
Published: January 2007

Darwin's original theory of biological evolution was purely qualitative. However, starting about 1920, R. A. Fisher, J. B. S. Haldane, and Sewalt Wright began to develop mathematical models of evolution. Thus, by today, mathematical evolutionary biology is very well developed. (see, for example. Wright (1969) for an overview.) However, there is an alternative approach to constructing quantitative theories of evolution: namely, computational modeling. The present paper describes a computational model of evolution involving kin selection. (For a review of mathematical models of kin selection, see Boorman and Levitt (1980).)
Towards the measurement of tuple space performance
Authors: Fiedler Daniel , Walcott Kristen , Richardson Thomas , Kapfhammer Gregory M. , Amer Ahmed , Chrysanthis Panos K.
Published: January 2007

Many applications rely upon a tuple space within distributed system middleware to provide loosely coupled communication and service coordination. This paper describes an approach for measuring the throughput and response time of a tuple space when it handles concurrent local space interactions. Furthermore, it discusses a technique that populates a tuple space with tuples before the execution of a benchmark in order to age the tuple space and provide a worst-case measurement of space performance. We apply the tuple space benchmarking and aging methods to the measurement of the performance of a JavaSpace, a current example of a tuple space that integrates with the Jini network technology. The experiment results indicate that: (i) the JavaSpace exhibits limited scalability as the number of concurrent interactions from local space clients increases, (ii) the aging technique can operate with acceptable time overhead, and (iii) the aging technique does ensure that the results from benchmarking capture the worst-case performance of a tuple space.
Round-trip time inference via passive monitoring
Authors: Lance Ryan , Frommer Ian
Published: January 2007

The round-trip time and congestion window are the most important rate-controlling variables in TCP. We present a novel method for estimating these variables from passive traffic measurements. The method uses four different techniques to infer the minimum round-trip time based the pacing of a limited number of packets. We then estimate the sequence of congestion windows and round-trip times for the whole flow. We validate our algorithms with the ns2 network simulator.
Recommended reading for IR research students
Authors: Moffat Alistair , Zobel Justin , Hawking David
Published: January 2007

The Strategic Workshop on Information Retrieval at Lorne (SWIRL 2004) was held in Lorne, Australia, from 8-10 December 2004, sec http://www.cs.mu.oz/~alistair/swirl2004/ for further information. A total of 38 international and Australian researchers and Australian graduate students took part.
ACM SIGIR workshop on mathematical/formal methods in information retrieval MF/IR 2005
Authors: Dominich Sándor , Ounis Iadh , Nie Jian-Yun
Published: January 2007

The previous five MF/IR workshops showed that the mathematical/formal results achieved in Information Retrieval (IR) could be organized into a coherent theoretical framework, that they brought new knowledge to IR, and that mathematical/formal research in IR can stand as a specialized research area of IR. Therefore the purpose of the MF/IR 2005 was to promote discussion and interaction among those with theoretical and applicative research interests in mathematical/formal aspects of Information Retrieval coming from a large spectrum of different IR fields, and also at being a forum for the presentation of both theoretical and applicative results (e.g., foundational issues; description and/or integration of models; retrieval applications; mathematical/formal techniques, properties and structures in IR; existing and/or new theories and theoretical aspects, interdisciplinary approaches) using formal and mathematical approaches like Sets, Vectors, Similarity Functions, Probability, Algebra, Topology, Metric Spaces, Geometry, Logics, Graph Theory.
In memoriam
Authors: Ida Tetsuo
Published: January 2007

Prof. Eiichi Goto passed away on June 12, 2005 at the age of 74 after a long struggle with illness that was initially caused by diabetes. Despite his suffering, he continued to actively pursue his goals as a scientist, an engineer and an educator until his death. He was a Japanese pioneer in computing. His contributions in computing are so varied that one would need many pages to describe his achievements.
Intrinsic topological representation of real algebraic surfaces
Authors: Cheng Jin-San , Gao Xiao-Shan , Li Ming
Published: January 2007

Determining the topology of an algebraic surface is not only an interesting mathematical problem, but also a key issue in computer graphics and CAGD. An algorithm is proposed to determine the intrinsic topology of an implicit real algebraic surface
f
(
x,y,z
) = 0 in R
3
, where
f
(
x,y,z
) ∈
Q
[
x,y,z
] and
Q
is the field of rational numbers. There exist algorithms to determine the topology for algebraic surfaces of special type [2, 3, 4, 7]. The CAD method proposed by Collins [1] can divide the space into cylindrical parts. But it does not give the connection information neither the intrinsic representation.
Computation with hyperexponential functions
Authors: Li Ziming , Zheng Dabin
Published: January 2007

A multivariate hyperexponential function is a function whose
"logarithmic derivatives" are rational. Examples of
hyperexponential functions include rational functions, exponential
functions, and hypergeometric terms. Hyperexponential functions
play an important role in the handling of analytic and
combinatorial objects. We present a few algorithms applicable to
the manipulation of hyperexponential functions in an uniform
way.

Let F be a field of characteristic zero, on
which derivation operators
δ1,...,δℓ
and difference operators (automorphisms)
σℓ+1,...,
σm act. Let E
be an F-algebra. Assume that the
δi for 1
≤ i ≤ ℓ and
σj for
ℓ + 1 ≤ m can be extended to
E as derivation and difference operators.
Moreover, these operators commute with each other on
E. A hyperexponential element of
E over F is defined to be a
nonzero element h ∈
E such that

δ1(h) =
r1h,
...,δℓ(h)
=
rℓh,
σℓ+1(h)
=
rℓ+1h,...,σm(h)
=
rmh

for some r1,...,
rm ∈
F. These rational functions are called
(rational) certificates for h.
Polynomial root-finding with matrix eigen-solving
Authors: Pan Victor
Published: January 2007

Numerical matrix methods are increasingly popular for polynomial root-finding. This approach usually amounts to the application of the QR algorithm to the highly structured Frobenius companion matrix of the input polynomial. The structure, however, is routinely destroyed already in the first iteration steps. To accelerate this approach, we exploit the matrix structure of the Frobenius and generalized companion matrices, employ various known and novel techniques for eigen-solving and polynomial root-finding, and in addition to the Frobenius input allow other highly structured generalized companion matrices. Employing polynomial root-finders for eigen-solving is a harder task because of the potential numerical stability problems, but we found some new promising directions, particularly for sparse and/or structured input matrices.
Mobile mathematics communication
Authors: Belov Nadya , Koeck Colin , Krandick Werner , Shaffer Joshua
Published: January 2007

We present a system [1] that allows wireless smartphones to be
used for mathematics communication, that is, for the creation and
exchange of mathematical formulas, diagrams, and text between two
or more participants. The system enables two or more persons with
smartphones or traditional computers to participate in a session.
Each of the participants may convey textual, graphical and
mathematical information to the other participants. Users can draw,
edit, and label geometric shapes, send chat messages, and compose
formulas. A turn taking mechanism moderates the communication. The
system also supports the integration of services that can be used
to provide individual users with additional functionality.
Currently, a LATEX rendering service is available to allow users to
create and share mathematical formulas in typeset quality.

Wireless smartphones are becoming the medium of choice for
improvised synchronous collaboration since increasing numbers of
users carry their smartphones at all times. It is true that the
small size of the devices---while necessary for their
ubiquity---limits the complexity of collaborative tasks that can be
carried out effectively. On the other hand, there is a need to
capture inspiration, to access and evaluate information on the go,
and to make decisions on the spot.

The domain of mathematics is ideally suited to explore---and
push---the limits of smartphone communication. The challenge of
representing mathematics in typeset form has led to the development
of document preparation systems such as TEX, LATEX, and LYX which
are in widespread use today. Mathematical handwriting recognition
continues to push the limits of general handwriting recognition
[2]. Many of the cognitive challenges that arise in mathematical
collaboration also arise in intellectual teamwork in other
domains.

Some of the challenges of developing a system for mobile
mathematics communication are posed by the input and output
limitations of the devices and the enormous heterogeneity of the
available hardware platforms.

We use the Treo 600/650 as our hardware platform. Our software
is written in pure Java and can be run on any platform that
supports the Java Virtual Machine. Our software architecture makes
it easy to add new local or remote services to enhance the
communication.

The poster presents use-case diagrams, architecture diagrams,
and a series of screenshots that describe the user's interaction
with the system. The poster also shows how we solved the problems
of cross-referencing and turn-taking in mobile collaboration. A
7.5-minute video shows users interacting with the system.
Beware of the Gibson mix
Authors: Palme Jacob
Published: January 2007

Evaluation of computer systems is sometimes made using a so-called Gibson mix. This is a list of common machine instructions with weights depending on how often they are supposed to occur in typical programs. By using these weights to estimate the mean instruction execution time, the "speed" of a computer system is supposed to be measured.
What is OpenAccess?
Authors: Guiney Michaela
Published: January 2007

OpenAccess is a community effort to enable interoperability among IC design tools through an open source standard data access interface (API) and Reference Implementation of that API. Today, many design flows use common data formats (Verilog, DEF, GDSII, SPEF) to exchange information between tools. Unfortunately, this collection of data files often represents an incomplete and inconsistent view of the design. In contrast, the OpenAccess information model is more complete and unambiguous. The API is object-oriented, written in C++. It was built from the start for open community use. Consistency was emphasized during the design of the API, in order to make it easier to understand and use. It also has extensive online documentation.The OpenAccess information model covers a large portion of the EDA domain. It represents both logical and physical hierarchy and connectivity, as well as an occurrence model which relates the two. It includes custom geometry, routing topology and floor planning information, parameterized cells, and technology information. It also provides a parasitic network API which enables access to parasitics on a per-net or even per-subnet basis, to minimize memory usage. Finally, the API supports definition of extensions to most objects, which can optionally be saved.The API has been designed to support typical application access to EDA data. Various collections are supported, with filters for different types of usage. The API supports efficient searches, utilities such as Region Query, and name mapping capabilities. Multiple Design Management (DM) implementations are possible via a plug-in mechanism. The Reference Implementation has been tuned for improved performance and memory efficiency. Information and relationships are cached on the fly, depending on application access. An initial version of a Tcl binding to the C++ API is also available for use.The OpenAccess Coalition of companies interested in promoting interoperability through OA now numbers more than thirty. The current version of OpenAccess, OA 2.2, is supported by a number of products from both large and small EDA companies, and usage at IC design companies is growing. Universities such as UC Berkeley, CMU and University of Michigan are using OA to build tools and perform research in Design Automation.For more information on the OpenAccess Coalition, see http://www.si2.org/?page=69, and for how to download OpenAccess code and documentation, go to http://www.openeda.si2.org. To learn about the OA Gear project coordinated by Cadence Berkeley Labs visit http://openedatools.si2.org/projects/oagear.
Comparison of graph-based and logic-based multi-relational data mining
Authors: Ketkar Nikhil S. , Holder Lawrence B. , Cook Diane J.
Published: January 2007

We perform an experimental comparison of the graph-based multi-relational data mining system, Subdue, and the inductive logic programming system, CProgol, on the Mutagenesis dataset and various artificially generated Bongard problems. Experimental results indicate that Subdue can significantly outperform CProgol while discovering structurally large multi-relational concepts. It is also observed that CProgol is better at learning semantically complicated concepts and it tends to use background knowledge more effectively than Subdue. An analysis of the results indicates that the differences in the performance of the systems are a result of the difference in the expressiveness of the logic-based and the graph-based representations. The ability of graph-based systems to learn structurally large concepts comes from the use of a weaker representation whose expressiveness is intermediate between propositional and first-order logic. The use of this weaker representation is advantageous while learning structurally large concepts but it limits the learning of semantically complicated concepts and the utilization background knowledge.
Multi-Relational Data Mining 2005
Authors: Blockeel Hendrik , Džeroski Sašo
Published: January 2007

In this report we briefly review the 4th Workshop on Multi-Relational Data Mining (MRDM-2005), which was organized by the authors and held in Chicago, IL, on August 21, as part of the workshop program of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. The goal of the workshop was to bring together researchers and practitioners of Data Mining interested in methods and applications of finding patterns in expressive languages from multi-relational, complex, and/or structured data.
BIOKDD 2005 workshop report
Authors: Parthasarathy Srinivasan , Wang Wei , Zaki Mohammed
Published: January 2007

Bioinformatics is the science of managing, mining, and interpreting information from biological entities. Genome sequencing projects have contributed to an exponential growth in complete and partial sequence databases. The structural genomics initiative aims to catalog the structure-function information for proteins. Advances in technology such as microarrays have launched the subfield of genomics and proteomics to study the genes, proteins, and the regulatory gene expression circuitry inside the cell. What characterizes the state of the field is the flood of data that exists today or that is anticipated in the future; data that needs to be mined to help unlock the secrets of the cell. Knowledge extracted from such analysis can be used effectively to better design new drugs, offer better medical care via diagnostic tests that combine information from multiple sources, and improve scientific and clinical practice.
Data mining standards, services and platforms 2005 workshop report
Authors: Pechter Rick
Published: January 2007

This report is a summary of the workshop on Data Mining Standards, Services and Platform, which was held at the KDD 2005 in Chicago on August 21, 2005. The workshop included several presentations on the application of data mining standards in various systems and platforms, as well as presentations on recent changes to the PMML standard, an opening panel discussion and a concluding round-table forum.
The 6th international workshop on Multimedia Data Mining (MDM/KDD2005)
Authors: Bouali Fatma , Khan Latifur , Masseglia Florent
Published: January 2007

In this report, we provide a summary of the issues and research directions on Multimedia Data Mining and the outcomes of the MDM/KDD'05 workshop that was held in conjunction with the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2005), August 21--24 in Chicago IL.
Association against dissociation
Authors: Pal Sukomal , Bagchi Aditya
Published: January 2007

Traditionally,
support
is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called
togetherness
where dissociation among items is also considered as a parameter in the frequent itemset generation process. Results of performance analysis show that association against dissociation is a more pragmatic approach and discovers truly associated candidate itemsets. Second part of the paper extends this
togetherness
measure to the domain of variable threshold. Here, like variable minimum
support
, a variable minimum
togetherness
has been proposed where this minimum value decreases as the itemset size increases. A simple and pragmatic process has been described, which can be easily implemented. It also provides ample control facilities in the hand of the users. Necessary change and extension of the existing algorithms have been made to establish the concepts. Here as well, results of performance analysis justify the approach.
Localization on the pushpin computing sensor network using spectral graph drawing and mesh relaxation
Authors: Broxton Michael , Lifton Joshua , Paradiso Joseph A.
Published: January 2007

This work approaches the problem of localizing the nodes of a distributed sensor network by leveraging distance constraints such as inter-node separations or ranges between nodes and a globally observed event. Previous work has shown this problem to suffer from false minima, mesh folding, slow convergence, and sensitivity to initial position estimates. Here, we present a localization system that combines a technique known as spectral graph drawing (SGD) for initializing node position estimates and a standard mesh relaxation (MR) algorithm for converging to finer accuracy. We describe our combined localization system in detail and build on previous work by testing these techniques with real 40-kHz ultrasound time-of-flight range data collected from 58 nodes in the Pushpin Computing network, a dense hardware testbed spread over an area of one square meter. In this paper, we discuss convergence characteristics, accuracy, distributability, and the robustness of this localization system.
From market-driven agents to market-oriented grids (position paper)
Authors: Sim Kwang Mong
Published: January 2007

Providing efficient mechanism for allocation and management of resources is essential for realizing a computational grid. Since resource providers and consumers may be independent bodies in a computing grid platform, negotiation among these participants is necessary. This position paper discusses (i) the design considerations of e-negotiation agents for grid commerce, and (ii) the possible application of Market-driven agents (MDAs) as negotiation mechanisms for managing resources in a computational grid. MDAs are negotiation agents designed with the flexibility of (i) making adjustable amounts of concession taking into account factors such as market rivalry, time preferences, and outside options, and (ii) relaxing trade expectation in the face of intense pressure. In addition to having stable strategies, making prudent compromises and optimizing utility, additional desirable properties of MDAs that are suitable for a computational grid include: adaptivity to changes in market conditions, and flexibility of reaching faster consensus.
Experiments with planning and markets in multiagent systems
Authors: Muguda Naveenkumar , Wurman Peter R. , Young R. Michael
Published: January 2007

Mobile devices are hand-held devices used to deliver time sensitive and locale specific information to the users. Users of multi-user environments with limited resources can be enabled with agents running on mobile devices as assistants to improve their ability to plan activities in the space. This paper discusses experiments to characterize the benefits of planning in such an environment, particularly when the resources can be reserved and the reservations traded in a market. We observe that with tradable reservations the social welfare increases with increase in planning horizon. We also observe that tradable reservations and clairvoyance help the users satisfy their preferences and the constraints imposed by environment.
Conference report
Authors: Pennock David M.
Published: January 2007

This report summarizes events and activities at the Fifth Association for Computing Machinery (ACM) Conference on Electronic Commerce (EC'04), held May 17-20 2004 in New York City. The program featured twenty-four talks, twenty-one brief announcements, three tutorials, an award for Best Student Paper, a joint session with the Thirteenth International World Wide Web conference, and a joint invited keynote speech by Udi Manber.
TacTex-03
Authors: Pardoe David , Stone Peter
Published: January 2007

This paper introduces TacTex-03, an agent designed to participate in the Trading Agent Competition Supply Chain Management Scenario (TAC SCM). As specified by this scenario, TacTex-03 acts as a simulated computer manufacturer in charge of buying components such as chips and motherboards, manufacturing different types of computers, and selling them to customers. TacTex-03 was the top scorer in two of the preliminary rounds of the 2003 TAC SCM competition, and finished in 3rd place in the finals.
Web services discovery based on the trade-off between quality and cost of service
Authors: Hung Patrick C. K. , Li Haifei
Published: January 2007

A Web service is an autonomous unit of application logic that provides either some business functionality or information to other applications through an Internet connection. Web services discovery is the process of finding most appropriate Web services providers needed by a Web services requestor. One of the important issues in the discovery process is for Web services providers and Web services requestors to negotiate and find an integrative solution that is optimal to both sides. Web services providers use resources to provide services to requestors in return for benefits. On the other hand, Web services requestors pay for services from providers in return for benefits as well. In this scenario, both parties should have their own cost-benefit models for making such a business decision. In convention, fixed pricing strategies are used for Internet-related business models such as online bookstores. However, these may not be suitable in some business models. For example, data mining services are always one-of-a-kind services, expensive and non-repetitive that usually require a more sophisticated business model. Therefore, sophisticated Web services providers should provide a list of trade-off alternatives between the Quality of Service (QoS) they offer and the Cost of Service (CoS) they use to requestors. In this model, the QoS relates to performance-oriented capabilities and the CoS relates to services' resource requirements. To achieve an integrative solution, both parties have to evaluate the list of QoS and CoS alternatives for obtaining an appropriate combination. One of the negotiation strategies for achieving integrative solutions is called logrolling. Traditionally logrolling in two-issue (i.e., the QoS and CoS) and two-party (i.e., the Web services provider and requestor) negotiation is defined as the exchange of loss in one issue for gain in other issues that result in an increase of the overall values for both parties. It means that each party can increase the overall value by trading the less preferred issue for the more preferred, provided that a trade-off ratio is satisfactory. This paper presents a token-based approach to quantify the QoS and CoS for achieving integrative solutions.
Equilibrium analyses of market-driven agents
Authors: Sim Kwang Mong
Published: January 2007

Market-driven agents (MDAs) are negotiation agents that make adjustable amounts of concession by considering factors such as competition, deadlines, and trading options. While previous work demonstrates the properties of MDAs by experiments, this paper provides mathematical analyses to show that (1) for a given market situation, an MDA makes minimally sufficient concession, and (2) the strategies adopted by MDAs are in equilibrium. The results show that MDAs are stable (stability is an essential evaluation criterion for negotiation agents) and they avoid making excessive or inadequate concession in a market situation.
Conference report
Authors: Leyton-Brown Kevin , McGrew Bob , Porter Ryan
Published: January 2007

Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee.
Energy-efficient data organization and query processing in sensor networks
Authors: Gummadi Ramakrishna , Li Xin , Govindan Ramesh , Shahabi Cyrus , Hong Wei
Published: January 2007

Recent sensor networks research has produced a class of data storage and query processing techniques called Data-Centric Storage that leverages locality-preserving distributed indexes to efficiently answer multi-dimensional range and range-aggregate queries. These distributed indexes offer a rich design space of a) logical decompositions of sensor relation schema into indexes, as well as b) physical mappings of these indexes onto sensors. In this paper, we discuss this space for energy-efficient data organizations (logical and physical mappings of tuples and attributes to sensor nodes) and examine the performance of purely local query optimization techniques for processing queries that span such decomposed relations.-
A dynamic-mode DVS algorithm under dynamic workloads
Authors: Wang Yan , Cheng Albert M. K.
Published: January 2007

Dynamic Voltage Scaling (DVS) is a promising method to achieve energy saving by slowing down the processor into multiple frequency levels especially in battery-operated embedded systems. We introduce a novel Dynamic-Mode EDF scheduling algorithm when workloads change significantly. Single-Mode, Dual-Mode and Three-Mode frequency setting formats can be applied, based on the Real Execution Time (RET) and the slack time at run-time. Only one combination of the time zone length and the frequency scaling factor can lead to the best energy saving. Experimental results show that, given an RET pattern, our Dynamic-Mode DVS algorithm achieves an average 15% energy savings over the traditional two-mode DVS scheme on hard real-time systems.
Fixed-priority scheduling of variable rate tasks for an autonomous mobile robot
Authors: Qadi Ala , Goddard Steve
Published: January 2007

We present an autonomous, mobile, robotics application that requires dynamic adjustments of task execution rates to meet the demands of an unpredictable environment. The Robotic Safety Marker (RSM) system consists of one lead robot, the foreman, and a group of guided robots, called robotic safety markers (a.k.a., barrels). The application requires adjusting task periods on the foreman to achieve desired performance metrics with respect to the speed at which a system activity is completed, the accuracy of RSM placement, or the number of RSMs controlled by the foreman. A static priority scheduling solution is proposed that takes into consideration the strict deadline requirements of some of the tasks and their dynamic periods. Finally, a schedulability analysis is developed that can be executed online to accommodate the dynamic performance requirements and to distinguish between safe operating points and potentially unsafe operating points.
TCX project
Authors: Nguyen Thuy D. , Levin Timothy E. , Irvine Cynthia E.
Published: January 2007

An overview of the Trusted Computing Exemplar (TCX) research project and its accomplishments to date are presented. The TCX project is constructing a separation kernel that will be high assurance and suitable for use in simple embedded systems. To guide the kernel development, we have created a reusable high assurance development framework. The main emphasis of this multifaceted research and development initiative is to transfer knowledge and techniques for high assurance trusted system development new developers, evaluators and educators.
From software sensitivity to software dynamics
Authors: Zalewski Janusz
Published: January 2007

This paper outlines an approach and presents preliminary results to describe behavior of real-time software architectures using concepts from dynamical systems. The basic idea is to change deadlines by decreasing them within certain range and take measurements on the number of missed deadlines and the total time by which the deadlines have been missed. A resulting curve, illustrating the dependence between the missed deadlines and their decrease, characterizes system dynamics. It can be approximated by a straight line or an exponential shape, from which certain dynamic parameters can be calculated.
Visual environment for high performance real-time 3D reconstruction
Authors: Morón Célio E. , Faria Lilian N. , Mascarenhas Nelson D. A. , Saito José H. , Rosa Reinaldo R. , Sawant Hanumant S.
Published: January 2007

We are carrying out a development of a whole system for processing solar images in a high performance parallel system. The main objective is to create the initial conditions for studying and forecasting the solar explosions in real time. Due to the high computational costs involved in the processing, visualization and analysis of a great amount of solar images, a high performance computer system becomes necessary to carry out the forecast of solar explosions. As a joint effort between the Department of Computer Science at Federal University of São Carlos (UFSCar), the Astrophysics Division (DAS) and Associated Laboratory for Computing and Applied Mathematics (LAC) at National Institute for Space Research - INPE, a high performance parallel system was developed with capacity to support realistic applications, involving a reasonable amount of parallel processing. The forecast of solar explosions is important as they may cause serious perturbations in terrestrial communication systems. A significant limitation for the development of parallel real-time systems is the lack of adequate programming tools, mainly for supporting the final stages of the development life cycle. This work presents a development environment, called Visual Environment for the Development of Parallel Real-Time Programs, that supports the design and implementation of parallel real-time applications executed with the support of a parallel kernel. This paper shows how this Environment was used to carry out the 3D Reconstruction of Solar Images.
Towards laying common grounds for embedded system design education
Authors: Marwedel Peter
Published: January 2007

In this paper, we propose to introduce a common introductory course for embedded system education. The course puts the different areas of embedded system design into perspective and avoids an early over-specialization. Also, it motivates the students for attending more advanced theoretical courses. The content, the structure and the prerequisites of such a course are outlined. The course requires a basic understanding of computer hardware and software and can typically be taught in the second or third year.
A case study in efficient microcontroller education
Authors: Weiss Bettina , Gridling Günther , Proske Markus
Published: January 2007

Undergraduate education typically is characterized by a large number of students. Therefore, courses must be conducted efficiently and should not only focus on conveying the course material, but must also be oriented towards a maximum transfer of knowledge with a minimum amount of invested time on the instructor's part. At the same time, courses should be flexible to accommodate different student needs.In this paper, we identify the needs of a practical course in microcontroller programming with respect to course structure and grading, present our solutions, and discuss our experiences.
Computers centers are cancers
Authors: Addleman Edrice
Published: January 2007

Most computer centers have become permanent parts of the organizations they are designed to "serve." And many, if not most, of these centers cannot be justified in terms of serving the goals of their organization.
Licensing
Authors: Cover Jack
Published: January 2007

Data Processing began the uphill battle to professional status with the advent of the Data Processing Management Association's Certificate in Data Processing (CDP) in 1962. The success of this effort is still in question. Arnold Keller, Editor of Infosystems, referred to the CDP as "an inside joke" in a February 1975 editorial. The CDP, however, has played a very useful role in offering a competence exam for those in the profession without a college degree.