ppxscal/embedding_network huggingface dataset:
A Network Early-Warning Architecture Using Mobile Agent
Authors: Jianbiao Zhang, Chuangbai Xiao
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

This paper presents a network early-warning architecture based on intrusion detection using mobile agent. This model can predict potential attacks based on rules among suspicious events, which are produced by basic intrusion detection module. Depending on the current needs of the deduction process, it can dispatch relevant mobile agents to collect further suspicious events. The advantage of this model is that: on the one hand it can lower network traffic and system load because of using mobile agent; on the other hand it can reduce thenumber of false positives, predict potential attacks, and furthermore prepare the response in advance.
Direction-of-Arrival Estimation (DoA) Using Switched Parasitic PlanarArrays and the Method of Genetic Algorithms
Authors: Pantelis K. Varlamos, Christos N. Capsalis
Venue: Wireless Personal Communications: An International Journal (2004)

An electronically controllable, switched parasitic planar array can be used for the purpose of direction finding. The method proposed in this paper exploits the electronic beam steering, achieved by simply inserting an appropriate digital word in the antenna feeding circuit, to resolve two signals. A genetic algorithm was used to determine the strengths and the angular positions of the incoming signals in the azimuth plane. The results obtained concentrate on wideband signaling in a multipath environment, with and without the presence of noise. The antenna design and the reliability of the direction-finding method are presented. The proposed method is strongly dependent on the type of the receiving antenna (a switched parasitic planar array is superior to a ``uniform'' antenna with identical radiation patterns). Increasing the number of radiation patterns available improves the reliability of the method. The reliability of the method slightly deteriorates, as the angular discrimination of the incoming signals becomes smaller, but the results remain quite satisfying.
Personnel assignment problem with hierarchical ordering constraints
Authors: Ismail H. Toroslu
Venue: Computers and Industrial Engineering (2003)

In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering constraint' (APHOC). As its name implies, hierarchical constraints are introduced on both partitions, and, the matching between the partitions should respect these hierarchical ordering constraints. A natural version of such constraints occurs in personnel assignment problem, where one of the partitions is a level graph representing the ranks of personnel, and the other one is a forest, representing the positions. We will first show that this problem is NP-complete. Then, we will investigate some heuristic and approximate solutions. Finally, we will study the performances of these solutions.
Data Access Routines
Authors: Martin Fowler
Venue: IEEE Software (2003)

One of the most important things about good design is modularity dividing a system into separate pieces so that you can modify one module without the changes rippling all over the system. As David Parnas observed, modules should be arranged around system secrets, each module hiding its secret from the others. Then if the secret thing changes, you avoid a ripple effect.One of the most common secrets to hide these days is data structures. This column discusses guidelines for basic data hiding. The examples all use objects, but the arguments apply just as well to non-OO modules.
Introduction
Authors: M. Barr, P. J. Scott, R. A. G. Seely
Venue: Mathematical Structures in Computer Science (2000)

On December 5, 1997, a small conference was held at McGill on the occasion of Jim Lambek's 75th birthday. Subsequently it was decided to publish two volumes of papers contributed in his honour to mark this occasion: this issue of Mathematical Structures in Computer Science is one of the volumes; the other is Volume 6 of the journal Theory and Applications of Categories. At the December 1997 conference, a brief biographical essay was presented by Michael Barr and appears in the TAC volume. However, we wish to make some further remarks here.Jim completed his Ph.D. at McGill under Hans Zassenhaus in 1950, and has remained at McGill since then. But it is of interest to note that Jim wrote two theses: the second involved biquaternions in mathematical physics, and so foreshadows a significant feature of his career: Jim has consistently shown a remarkable range of interests, from physics to linguistics, from algebra to logic, from the history and philosophy of mathematics to the theory of computing science (although he never touches a computer, to this day!). Let us just review a small sample of his more than 100 published papers.
Assessing the Business Impact of Location Based Services
Authors: Bharat Rao, Louis Minakakis
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Location based services are a growth area for service providers looking to fulfill new customer needs, and network operators looking to augment their revenues. While the idea of using information about customer location to deliver focused services may be extremely appealing, there are significant risks and challenges to be faced. In addition to the technical hurdles,understanding and catering to customer experience is critical for success. In this paper, we will describe recent developments in the area of LBS, and propose a model to address customer experience issues in this domain. In particular, we will describe the types of revenue models and niche applications that might be profitably targeted by LBS providers.
Irreducible trinomials over finite fields
Authors: Joachim von zur Gathen
Venue: Mathematics of Computation (2003)

A necessary condition for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special case F3, and some experimental discoveries are reported.
What's wrong with &#x0022;What's wrong with&#x0022;
Authors: Russell L. Ackoff
Venue: Interfaces (2003)

People meet many (if not most) proposed changes of systems with answers to the question, "What's wrong with the suggestion?" This focus prevents the implementation of many potentially innovative changes. An alternative question is preferable: "How can we improve the proposed changes?" The answers can lead to the design of an improvement in a system's behavior, for example, improvements to the public school system resulting from the proposed school vouchers and changes to the national health-care system.
LAMP development at public sector web sites
Authors: Tom Adelstein
Venue: Linux Journal (2004)

Government IT staff and open-source consultants are keeping public information open and accessible--and saving tax money too.
What causes stress in information system professionals?
Authors: Vikram Sethi, Ruth C. King, James Campbell Quick
Venue: Communications of the ACM (2004)

Job stress can lead to burnout and turnover, costing IT organizations countless dollars in replacement costs, and making methods for measuring and minimizing stress a business benefit.
Non-linear loop invariant generation using Gröbner bases
Authors: Sriram Sankaranarayanan, Henny B. Sipma, Zohar Manna
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

We present a new technique for the generation of non-linear (algebraic) invariants of a program. Our technique uses the theory of ideals over polynomial rings to reduce the non-linear invariant generation problem to a numerical constraint solving problem. So far, the literature on invariant generation has been focussed on the construction of linear invariants for linear programs. Consequently, there has been little progress toward non-linear invariant generation. In this paper, we demonstrate a technique that encodes the conditions for a given template assertion being an invariant into a set of constraints, such that all the solutions to these constraints correspond to non-linear (algebraic) loop invariants of the program. We discuss some trade-offs between the completeness of the technique and the tractability of the constraint-solving problem generated. The application of the technique is demonstrated on a few examples.
The generalised mass-energy equation &#x03B4;E=AC2&#x03B4;M: its mathematical justification and application in general physics and cosmology
Authors: Ajay Sharma
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Einstein derived (in Sep 1905 paper), an equation between light energy (L) emitted and decrease in mass (m) of body i.e. Δm = L/c2 (which is speculative origin of E = c2Δm) completely disregarding other possibilities from the derivation. It theorizes when light energy (L) is emanated from luminous body, then mass of body decreases. In blatant way the same mathematical derivation (under logical conditions), contradicts the law of conservation of matter and energy but these are unnoticed yet. For example, it is equally feasible (as feasible as Dirac's prediction of positron) from the same mathematical derivation that the mass of source must also INCREASE or remain the SAME when it emits light energy. It clearly implies that mass of body inherently increases when energy is emitted or energy is emitted from body without change in mass. Then Einstein speculated general Mass Energy Equivalence ΔE = c2ΔM from it without mathematical proof. All these aspects are logically discussed here thus Einstein's unfinished task has been completed here. Further an alternate equation i.e. ΔE = Ac2 ΔM, has been purposely derived, in entirely different and flawless ways taking in account the existing theoretical concepts and experimental results. The new equation implies that energy emitted on annihilation of mass (or vice versa) can be equal, less and more than predicted by Einstein's equation. It successfully explains the energy emitted (1045J) in Gamma Ray Bursts (intense and short) with high value of A i.e. 2.57 × 1018. The energy emitted by Quasars (15.56 × 1041J) in extremely small region can be explained with value of A as 4 × 1016. Recent work at SLAC confirmed discovery of a new particle, whose mass is far less than current estimates, the same can be explained with help of equation ΔE = Ac2 ΔM with value of A more then one. ΔE = Ac2 ΔM, is the first equation which mathematically explains that mass of universe 1055kg was created from dwindling amount of energy (10-444J or less) with value of A 2.568 × 10-471 J or less. Whereas E = Δmc2 predicts the mass of universe 1055kg was originated from energy 9 × 1071 J. Einstein's ΔE = c2ΔM is not confirmed in chemical reactions, but regarded as true. If one gram of wood or paper or petrol is burnt under controlled conditions, and just 10-9 kg is converted into energy then energy (9 × 107 J is equal to 2.15 × 104 kcal) emitted can a body of mass 1kg to a distance of 9 × 107 m 9 × 104 km or heat water equal to 2.15 × 104 kg through 1°C. If energy released in chemical reaction (at any stage) is found less than Einstein's equation ΔE = c2ΔM, then value of A less than one in ΔE = Ac2ΔM will be confirmed.
Custom Wide Counterflow Pipelines for High-Performance Embedded Applications
Authors: Bruce R. Childers, Jack W. Davidson
Venue: IEEE Transactions on Computers (2004)

Abstract--Application-specific instruction set processor (ASIP) design is a promising technique to meet the performance and cost goals of high-performance systems. ASIPs are especially valuable for embedded computing applications (e.g., digital cameras, color printers, cellular phones, etc.) where a small increase in performance and decrease in cost can have a large impact on a product's viability. Sutherland, Sproull, and Molnar originally proposed a processor organization called the counterflow pipeline (CFP) as a general-purpose architecture. We observed that the CFP is appropriate for ASIP design due to its simple and regular structure, local control and communication, and high degree of modularity. This paper describes a new CFP architecture, called the wide counterflow pipeline (WCFP), that extends the original proposal to be better suited for custom embedded instruction-level parallel processors. This work presents a novel and practical application of the CFP to automatic and quick turnaround design of ASIPs. The paper introduces the WCFP architecture and describes several microarchitecture capabilities needed to get good performance from custom WCFPs. We demonstrate that custom WCFPs have performance that is up to four times better than that of ASIPs based on the CFP. Using an analytic cost model, we show that custom WCFPs do not unduly increase the cost of the original counterflow pipeline architecture, yet they retain the simplicity of the CFP. We also compare custom WCFPs to custom VLIW architectures and demonstrate that the WCFP is performance competitive with traditional VLIWs without requiring complicated global interconnection of functional devices.
Ely the explorer: a multi-user interactive play system to promote collaborative learning
Authors: Diana Africano, Staffan Eriksson, Kent Lindbergh, Peter Lundholm, Fredrik Nilbrink
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper briefly presents a design concept for an interactive play system and learning tool for young children. In the search for more intuitive user-interfaces appropriate for children, we have proposed a system featuring a set of physical and virtual tools, which explores the qualities of different input and output modalities. The system allows for both independent exploration and group interaction. It provides a set of tangible tools that enable children to work together in the exploration and manipulation of content in order to achieve some joint outcome. We have exemplified the concept with Ely the Explorer, an accessible and robust multi-user unit and set of tangible tools designed for the school environment. We are currently developing a working prototype of the concept.
Performance prediction of wormhole switching in hypercubes with bursty traffic pattern
Authors: Geyong Min, Mohamed Ould-Khaoua, John Ferguson
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Wormhole switching has been extensively deployed in the current-generation of high-end parallel systems. The performance of wormhole switching in hypercubes has been primarily investigated under the assumption that traffic load follows a Poisson arrival process. However, many studies have shown that traffic in parallel computation environments can exhibit a high degree of burstiness and the Poisson arrival process is unable to model the behaviour of bursty traffic. This paper proposes a new analytical model for wormhole-switched hypercubes under bursty traffic. Simulation experiments demonstrate that the proposed model exhibits a good degree of accuracy under various operating conditions.
Testing iptables
Authors: Daniel Hoffman, Durga Prabhakar, Paul Strooper
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

iptables is the most recent entry in a series of Linux firewall services. Because iptables is a security product in widespread use, correctness and performance are important issues. We present a methodology for iptables regression testing. Typically, correctness test suites generate test inputs and then log the observed output to a file. Log files from the first execution are manually checked for correctness and then compared to the results from subsequent test runs with a file differencing utility. The log files tend to be large; checking their correctness is tedious and error-prone. In contrast, we generate test traffic and verify the correctness of the iptables behaviour from the same program, eliminating the need for log files. We also present performance test results, focusing on throughput and delay as a function of the size of the iptables rule base. The measurements were conducted over Ethernet links running at 10, 100, and 1,000 Mbps.
Exponential monotonicity of quadratic forms in ODEs and preserving methods
Authors: C. Elia, L. Lopez
Venue: Future Generation Computer Systems (2003)

In this paper we consider ODEs whose solutions satisfy exponential monotonic quadratic forms. We show that the quadratic preserving Gauss-Legendre-Runge-Kutta methods do not preserve this qualitative feature, while certain Lie group preserving methods, as Crouch-Grossman methods and methods based on projection techniques are suitable integrators for such a kind of differential problems. We also show that these differential problems may be solved via associated differential systems with quadratic invariants. Numerical tests are reported in order to confirm our theoretical results.
Error analysis of a derivative-free algorithm for computing zeros of holomorphic functions
Authors: P. Kravanja, T. Sakurai, M. Van Barel
Venue: Computing (2003)

We consider the quadrature method developed by Kravanja and Van Barel (Computing 63(1):69-91, 1999) for computing all the zeros of a holomorphic function that lie inside the unit circle. The algorithm uses only the function values and no (first or higher order) derivatives. Information about the location of the zeros is obtained from certain integrals along the unit circle. In numerical computations these are replaced by their trapezoidal rule approximations. We investigate the resulting quadrature error. Our error analysis shows that the zeros located inside the unit circle do not affect the accuracy of the computed approximations whereas the quadrature error related to the zeros located outside the unit circle tends to zero exponentially as the number of quadrature points tends to infinity.
Extremal Problems for Affine Cubes of Integers
Authors: David S. Gunderson, Vojtéch Rödl
Venue: Combinatorics, Probability and Computing (1998)

A collection H of integers is called an affine d-cube if there exist d+1 positive integers x0,x1,&hellip;, xd so that***** Insert equation here *****We address both density and Ramsey-type questions for affine d-cubes. Regarding density results, upper bounds are found for the size of the largest subset of {1,2,&hellip;,n} not containing an affine d-cube. In 1892 Hilbert published the first Ramsey-type result for affine d-cubes by showing that, for any positive integers r and d, there exists a least number n=h(d,r) so that, for any r-colouring of {1,2,&hellip;,n}, there is a monochromatic affine d-cube. Improvements for upper and lower bounds on h(d,r) are given for d>2.
Community informatics: enabling emancipatory learning
Authors: Wal Taylor, John Dekkers, Stewart Marshall
Venue: Current issues in IT education (2003)

In this chapter, a philosophical framework used in the development of an online course is provided. This philosophical framework is largely based on sociological theory that argues the need for a student-centered approach to learning in the modern age. The authors argue that this is an appropriate approach for the present and the future, which they consider will increasingly need to address changing learner needs and demands. A learner-centered approach can provide for self-paced learning, peer assessment, and opportunities for interactions with fellow students, work colleagues, and other peers. To date, there have been few examples of the integration of information technologies with emerging trends in distance and lifelong learning.
Community portals through communitization
Authors: Vanessa Donnelly, Roland Merrick
Venue: Issue 73-74 (June-September 2002) (2002)

Governments wishing to achieve high citizen adoption from electronic services need to provide solutions that are not only technically accessible, but usable and engaging to large numbers of people. Citizen diversity makes this a real challenge. Designing the best user experience for diverse users will require alternative designs on potentially different devices. The cost of doing this may prove prohibitive. One answer is to leverage "the third sector" i.e. voluntary organizations, special interest groups, communities and business related support organizations. Third sector organizations traditionally provide support to disadvantaged and potentially excluded groups and provide a way for government to increase social inclusion and reach a wider audience.To support the delivery of government information and services through multiple providers including but not restricted to the originating government version, this paper proposes to introduce the concept of "Communitization". The principle behind "Communitization" is to enable an interface to be adapted to suit the wants and needs of a community. For government this would provide a way to reach a broader set of citizens with a more tailored set of solutions without incurring any incremental cost. The benefit to citizens would be a custom design, tailored to their needs and integrated into sites they already use.
A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults
Authors: Jau-Der Shih
Venue: Information Processing Letters (2003)

In this paper, we present a fault-tolerant routing algorithm for torus networks by using only 4 virtual channels. The proposed algorithm is based on the solid fault model, which includes rectangular faults and many practical nonconvex faults. Previous works need at least 6 virtual channels to achieve the same fault-tolerant ability.
A case study on multisensor data fusion for imbalance diagnosis of rotating machinery
Authors: Qing Liu, Hsu-pin Wang
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Techniques for machine condition monitoring and diagnostics are gaining acceptance in various industrial sectors. They have proved to be effective in predictive or proactive maintenance and quality control. Along with the fast development of computer and sensing technologies, sensors are being increasingly used to monitor machine status. In recent years, the fusion of multisensor data has been applied to diagnose machine faults. In this study, multisensors are used to collect signals of rotating imbalance vibration of a test rig. The characteristic features of each vibration signal are extracted with an auto-regressive (AR) model. Data fusion is then implemented with a Cascade-Correlation (CC) neural network. The results clearly show that multisensor data-fusion-based diagnostics outperforms the single sensor diagnostics with statistical significance.