ppxscal/embedding_network huggingface dataset:
A binary classifier with applications to poorly defined engineering problems
Authors: Ian Flood, Nabil Kartam
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The paper proposes and evaluates a binary network architecture and complementary training algorithm designed for pattern classification, with applications in a variety of engineering problems. The advantages of the system are that it can always converge on zero error for a set of unambiguous training patterns (if required), converges rapidly, and circumvents the issue of how many hidden neurons to incorporate in a network. The main benefit of the proposed system over Hamming networks, its main counterpart, is that it can group patterns into different classes along any boundary. The system is shown to outperform 1) the Hamming network for a character recognition problem where the images are subject to both position change and noise; and 2) a radial-Gaussian network in a truck-type classification problem. A variant of the system, where hidden neuron thresholds are set to zero, is shown to further improve performance if a comprehensive set of noise-free input patterns are available for training.
Network intrusion visualization with NIVA, an intrusion detection visual and haptic analyzer
Authors: Craig Scott, Kofi Nyarko, Tanya Capers, Jumoke Ladeji-Osias
Venue: Information Visualization (2003)

The rapid growth of malicious activities on worldwide communication networks, such as the Internet, has highlighted the need for efficient intrusion detection systems. The efficiency of traditional intrusion detection systems is limited, in part, by their inability to relay effectively relevant information due to their lack of interactive/immersive technologies. In this paper, we explore several network visualization techniques geared toward intrusion detection on small- and large-scale networks. We also examine the use of haptics in network intrusion visualization. By incorporating concepts from electromagnetics, fluid dynamics, and gravitational theory, we show that haptic technologies can provide another dimension of information critical to the efficient visualization of network intrusion data. Furthermore, we explore the applicability of these visualization techniques in conjunction with commercial network intrusion detectors. Finally, we present a network intrusion visualization application with haptic integration, NIVA, which allows the analyst to interactively investigate as well as efficiently detect structured attacks across time and space using advanced interactive three-dimensional displays.
Geographic location tags on digital images
Authors: Kentaro Toyama, Ron Logan, Asta Roseway
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We describe an end-to-end system that capitalizes on geographic location tags for digital photographs. The World Wide Media eXchange (WWMX) database indexes large collections of image media by several pieces of metadata including timestamp, owner, and critically, location stamp. The location where a photo was shot is important because it says much about its semantic content, while being relatively easy to acquire, index, and search.The process of building, browsing, and writing applications for such a database raises issues that have heretofore been un- addressed in either the multimedia or the GIS community. This paper brings all of these issues together, explores different options, and offers novel solutions where necessary. Topics include acquisition of location tags for image media, data structures for location tags on photos, database optimization for location-tagged image media, and an intuitive UI for browsing a massive location-tagged image database. We end by describing an application built on top of the WWMX, a lightweight travelogue-authoring tool that automatically creates appropriate context maps for a slideshow of location-tagged photographs.
The Optimal Time Control of A Phase-Field System
Authors: Lijuan Wang, Gengsheng Wang
Venue: SIAM Journal on Control and Optimization (2003)

In this paper, we prove the existence of the optimal time control of a phase-field system by using the Carleman inequality, and we establish the maximum principle for the optimal time control problem governed by the phase-field system.
Existence of positive periodic solution for nonautonomous predator: prey system with diffusion and time delay
Authors: Shihua Chen, Junhua Zhang, Todd Young
Venue: Journal of Computational and Applied Mathematics (2003)

A two-species nonautonomous predator-prey system with time delay and diffusion is investigated. A sufficient condition of the existence of positive periodic solution is established for the system by using the continuation theorem of coincidence degree theory.
Design, Analysis, and Implementation of Analog Complex Filter for Low-IF Wireless LAN Application
Authors: T. Hui Teo, Ee-Sze Khoo, Dasgupta Uday, Chin-Boon Tear
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The design and implementation of an analog complexfilter for low-IF WLAN 802.11a receiver is described. AnIF of 20MHz is chosen as a trade off between image-rejectionand power consumption. The specified bandwidthis 20MHz. Baseband processing requires low group-delayvariation in the received signal to meet bit error rate (BER)specification. This requires a design of high frequency,wide bandwidth and high attenuation filter. To resolve theseissues, fifth-order complex transitional Bessel-Chebyshevfilter is implemented to compromise between high attenuationand low group-delay variation. Measured resultsshow the designed filter provides 30dB to 40dB image rejectionand 18dB adjacent channel rejection, while keepinga low group-delay variation of below 6.0ns within thepass-band. High frequency and wide bandwidth filter alsorequires stringent design specification of the circuitries.Differential inverter transconductor is optimized for thiscontinuous-time filter design. The complete filter includingon-chip tuning circuit and bandgap consumes only 7.5mAwith 1.8V single supply voltage. The circuit is fabricatedusing 0.18µm, 6-metal-single-poly CMOS process.
On the distribution of the number of roots of polynomials and explicit weak designs
Authors: Tzvika Hartman, Ran Raz
Venue: Random Structures Algorithms (2003)

Weak designs were defined in R. Raz, O. Reingold, and S. Vadhan [Extracting all the randomness and reducing the error in Trevisan's extractors, Proc 31st ACM Symp Theory of Computing, Atlanta, GA, May 1999, to appear in J Comput System Sci Special Issue on STOC 99] and are used there in constructions of extractors. Roughly speaking, a weak design is a collection of subsets satisfying some near-disjointness properties. Constructions of weak designs with certain parameters are given in Raz et al. These constructions are explicit in the sense that they require time and space polynomial in the number of subsets. However, the constructions require time and space polynomial in the number of subsets even when needed to output only one specific subset out of the collection. Hence, the constructions are not explicit in a stronger sense. In this work we provide constructions of weak designs (with parameters similar to the ones of Raz et al.) that can be carried out in space logarithmic in the number of subsets. Moreover, our constructions are explicit even in a stronger sense: Given an index to a subset, we output the specified subset in time and space polynomial in the size of the index. Using our constructions, we obtain extractors similar to some of the ones given in Raz et al. in terms of parameters, and that can be evaluated in logarithmic space. Our main construction is algebraic. In order to prove the properties of weak designs, we prove some algebro-combinatorial lemmas that may be interesting in their own right. These lemmas regard the number of roots of polynomials over finite fields. In particular, we prove that the number of polynomials (over any finite field) with k roots, vanishes exponentially in k. In other words, we prove that the number of roots of a random polynomial is not only bounded by its degree (a well-known fact), but, furthermore, it is concentrated exponentially around its expectation (which is 1). Our lemmas are proved by algebro-combinatorial arguments. The main lemma is also proved by a probabilistic argument.
Web navigation recorder eyetracking software application demo
Authors: María Santamaría
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

User testing is probably the most effective technique for evaluating the usability of interactive products. The Eyetracking Software application Demo shows two examples of web navigations. The recordings consist of an eight-year-old kids playing a quiz during 15 minutes: where do the children fix their eyes, what they click, how they express themselves. In brief, it will be shown as a movie the whole behaviour of a kid face to machine.
Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
Authors: Christine T. Cheng
Venue: SIAM Journal on Discrete Mathematics (2004)

In the demand routing and slotting problem on unit demands (unit-DRSP), we are given a set of unit demands on an n-node ring. Each demand, which is a (source, destination) pair, must be routed clockwise or counterclockwise and assigned a slot so that no two routes that overlap occupy the same slot. The objective is to minimize the total number of slots used. It is well known that unit-DRSP is NP-complete. The best deterministic approximation algorithm guarantees a solution that is 2 &times; OPT. A demand of unit-DRSP can be viewed as a chord on the ring. Let w denote the size of the largest set of demand chords that mutually cross in the interior of the ring. We present a simple approximation algorithm that uses at most $(2 - 1/\lceil w/2 \rceil)\times OPT$ slots in an n-node network; this is the first deterministic approximation algorithm that beats the factor of 2 for all values of OPT and therefore for all instances of the input. If randomization is allowed, an algorithm by Kumar produces, with high probability, a solution that uses asymptotically $(1.5 + \frac{1}{2e} +o(1)) \times OPT$ slots. However, when OPT is not large enough, the factor can exceed 2. In this paper, we show how combining our algorithm with Kumar's yields a randomized approximation algorithm that has, with high probability, a constant factor of $2 - 1/\theta(\log n)$. While asymptotically it is not better than Kumar's, the approximation factor holds for all values of OPT.
Measuring Information Technology's Indirect Impact on Firm Performance
Authors: Yao Chen, Joe Zhu
Venue: Information Technology and Management (2004)

It has been recognized that the link between information technology (IT) investment and firm performance is indirect due to the effect of mediating and moderating variables. For example, in the banking industry, the IT-value added activity helps to effectively generate funds from the customer in the forms of deposits. Profits then are generated by using deposits as a source of investment funds. Traditional efficiency models, such as data envelopment analysis (DEA), can only measure the efficiency of one specific stage when a two-stage production process is present. We develop an efficiency model that identifies the efficient frontier of a two-stage production process linked by intermediate measures. A set of firms in the banking industry is used to illustrate how the new model can be utilized to (i) characterize the indirect impact of IT on firm performance, (ii) identify the efficient frontier of two principal value-added stages related to IT investment and profit generation, and (iii) highlight those firms that can be further analyzed for best practice benchmarking.
Optical Disks as a Basis of Modern Paperless Data Processing
Authors: V. V. Petrov, A. A. Kryuchin, S. M. Shanoylo, V. I. Sidorenko
Venue: Cybernetics and Systems Analysis (2003)

Potentialities of the methods of information processing, distribution, and storage are analyzed. Directions are defined in which optical information media characteristics can be improved. Possibility of using optical media for a long-term storage of digital information is considered.
Implementation of Resilient Packet Ring Nodes Using Network Processors
Authors: Andreas Kirstädter, Axel Hof, Walter Meyer, Erwin Wolf
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Network processors offer a new flexibility for networkapplications and reduce the time to market for dataprocessing systems. In this paper, we describe thechanged development process of the data plane using theMotorola C-5 Network Processor. We implemented aResilient Packet Ring line card for a SDH cross connect.We show a solution for the support of different Quality ofService classes with a Network Processor and to achievethe necessary system stability. Additionally we carried outsome simulations to verify the performance of a fairnessalgorithm over the ring and the system behavior.
Coding the principal character formula for affine Kac-Moody Lie algebras
Authors: M. K. Bos
Venue: Mathematics of Computation (2003)

In this paper, an algorithm for computing the principal character for affine Lie algebras is discussed and presented. The principal characters discovered using this program are given and/or proven. Results include level 2 and 3 character formulas in A2n-1(2) and the sole existence of the Rogers-Ramanujan products in A1(1), A2(1), A2(2), C3(1), F4(1), G2(1), A7(2).
An Overview of Network-Aware Applications for Mobile Multimedia Delivery
Authors: Jinwei Cao, Dongsong Zhang, Kevin M. McNeill, Jay F. Nunamaker,  Jr.
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Network-aware Applications is a promising new concept in which applications are aware of network conditions and thus can adapt to the varying environment to achieve acceptable and predictable performance. This paper reviews the current research on network-aware applications, with a focus on their appliance on mobile multimedia applications. First, different frameworks or architectures of network-aware applications are introduced. Research issuesand activities are then discussed in detail from two basic aspects of network-aware applications: network awareness and network adaptation. After the discussion about network-aware applications in general network environments, special problems and requirements of mobile multimedia applications are summarized, and different network-aware application approaches for mobile multimedia delivery are compared with respect to these requirements. Finally, we provide some suggestions to network-aware mobile multimedia application developers and identify current challenges in this area.
Static analysis for bug finding in systems software
Authors: Dawson Engler
Venue:  (2003)

Building systems such as OS kernels and embedded software is notoriously difficult. A primary source of this difficulty is the numerous rules that must obeyed. For example, interrupts cannot be disabled for &ldquo;too long&rdquo;; global variables must be protected by locks; and user pointers passed to OS code must be checked for safety before use. A single violation can crash the system, lead to data corruption, or expose a security hole. Yet typically these invariants are unchecked, existing only on paper or in the implementor's mind. The only real practical methods known for verifying such code are testing and simulation, but these methods rarely exercise even a small fraction of executable paths. This work attacks this problem by providing a framework called Metacompilation (MC) that makes it easy to write simple compiler extensions to pinpoint errors in the program source code. These extensions can be written by system implementors themselves and, by exploiting system-specific information, can detect errors unreachable with other methods. We evaluate the MC approach by applying it to four complex, real systems: Linux, OpenBSD, the Xok exokernel, and the FLASH machine's embedded software. This has led to the discovery of over 1000 errors and has resulted in numerous patches to these systems. In addition, these results allow us to investigate the nature of the errors in Linux and OpenBSD. Our approach differs from previous studies that consider errors found by manual inspection of logs, testing, and surveys because static analysis is applied uniformly to the entire kernel source, though our approach necessarily considers a less comprehensive variety of errors than previous studies. In addition, automation allows us to track errors over multiple versions of the kernel source to estimate how long errors remain in the system before they are fixed.
Design, science, and engineering topics?: teaching HCI with a unified method
Authors: D. Scott McCrickard, C. M. Chewar, Jacob Somervell
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Reacting to challenges that have been observed in human-computer interaction (HCI) education, as well as the multidisciplinary design, science, and engineering underpinnings, we investigate a pedagogical approach based on case methods. Our study of various case method techniques in an undergraduate HCI class provides insights into challenges that can be expected in the employment of case methods, student learning outcomes, and considerations for HCI curriculum planning. In general, case methods show great promise with a wide variety of topics, and we present broad recommendations for future work that will improve integration of HCI professional practice, research, and education.
A proposed approach to process decomposition and collaboration for MARVEL
Authors: Andrew Z. Tong
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

An industrial-scale software process consists of a collection of subprocesses run by different people either simultaneously or at different times. This paper introduces a process decomposition and collaboration model to determine what the user and designer of such a process need from a Process-Centered Environment (PCE), and proposes extensions to a centralized rule-based PCE, MARVEL 3.1, to address some of those needs. This approach has a number of potential benefits such as support for various types of subprocess collaboration, decomposition of data and activities, distinction of specific points of view, process modularity, and parameterization of processes.
Agent-Based Framework for Dynamic Supply Chain Configuration
Authors: Denise Emerson, Selwyn Piramuthu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Supply Chain Management has gained renewed interest among researchers in recent years. This is primarily due to the availability of timely information across the various stages of the supply chain, and therefore the need to effectively utilize the information for improved performance. Although information plays a major role in effective functioning of supply chains, there is a paucity of studies that deal specifically with the dynamics of supply chains and how data collected in these systems can be used to improve their performance. In this paper we develop a framework, with machine learning, for automated supply chain configuration. Supply chain configuration used to be mostly a one-shot problem. Once a supply chain was configured, researchers and practitioners were more interested in means to improve performance given that initial configuration. However, recent developments in e-Commerce applications and faster communication over the Internet in general necessitate dynamic (re)configuration of supply chains over time to take advantage of better configurations. We model each actor in the supply chain as an agent who makes independent decisions based on information gathered from the next level upstream. Using examples, we show performance improvements of the proposed adaptive supply chain configuration framework over static configurations.
Evaluating the usability of portable electronic books
Authors: Ruth Wilson, Monica Landoni
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper outlines the methodology and results of the EBONI Project's evaluation of portable electronic books, in which staff from UK academia were provided with a selection of book readers and asked to report back on their experiences. A set of issues of importance to users of electronic books is uncovered, and compared with concerns arising from other experiments in the same field. Finally, recommendations for successful ebook design are made.
Interactive symbolic distortion analysis of analogue integrated circuits
Authors: Piet Wambacq, Georges Gielen, Willy Sansen
Venue: Proceedings of the conference on European design automation (1991)

A program is presented that generates symbolic expressions for the harmonic distortion, caused by weak nonlinearities in continuous-time analogue integrated circuits. The program relies upon the theory of Volterra series. An approximation algorithm with a user-definable error enhances the interpretability of the expressions. The results are in good agreement with results from a numerical simulator. The program can be used to analyse complex circuits such as operational amplifiers and to dvelop guidelines for low-distortion circuit design.
Electroless deposition in nanotechnology and ULSI
Authors: T. N. Khoperia
Venue: Microelectronic Engineering (2003)

The technology of electroless metallization was developed enabling one to adequately replace Au and Ag with Ni-P or Ni-B alloys in industry and to significantly simplify the metallization process. Other proposed nanotechnologies for the first time allow one to produce photomasks and microdevices with nano-sized adjacent elements of different thicknesses made of various materials by single conventional optical photolithography. These advantages significantly extend functional capabilities of the device and simplify removal of undesirable gases and heat dissipation. The proposed nanotechnologies are much more advantageous and simpler than other expensive and complicated methods such as e-beam, X-ray lithography or production of the devices using light phase shift photomasks. Methods of fabricating the ultra-thin void-free and pore-free electroless coatings on micro-, meso- and nano-sized particles (carbides, borides, nitrides, oxides, diamond, graphite, etc.) are also proposed. These methods allow one to obtain nanostructured composite materials and coatings with the specified properties. The developed technologies have been implemented in industry.
Shared virtual worlds for education: the ExploreNet experiment
Authors: Charles E. Hughes, J. Michael Moshell
Venue: Multimedia Systems (1997)

ExploreNet is an experimental environment for creating and delivering networked "virtual worlds." This system's style of user interaction was inspired by the concept of a "habitat" as first articulated in the LucasFilm's Habitat system. Players enter and interact in a habitat via their animated alter egos, called "avatars." Habitats may be created for many purposes, including social interaction, entertainment and education. Our focus has been to facilitate the creation of habitats in which virtual communities of learners and mentors interact. This paper presents details of the current ExploreNet system, including its user interface, the means it provides for creating complex behaviors, details of its implementation, the outcomes of several experiments using this system, and our plans for its natural migration to a World Wide Web-based system.