ppxscal/embedding_network huggingface dataset:
Reliability estimation in complex simulation environments
Authors: Tammie Lea Cumming
Venue:  (2003)

Over the past several years, driving performance research has undergone significant changes. Many of the changes have been the result of advances in computer and engineering technology. High-fidelity, motion-based simulators are available for research that was never before considered possible. These technological innovations have changed the elements of driving performance assessment. When simulation studies were gaining popularity a generation ago, Leonard and Wierwille (1975) recognized that the evaluation of the psychometric properties of the simulator data was one of the greatest challenges to researchers utilizing such tools. The examination of measurement methods applied in a novel situation, such as a simulation environment, was the primary motivation of this research. This research examined various characteristics of data collected by the Iowa Driving Simulator (IDS) and applied internal consistency methods to determine the reliability of the driving performance of speed and steering control. Of particular interest was the effect of time on the magnitude of the reliability coefficient and the validity of psychometric methods for estimating how time affects reliability. Woodruff's ANOVA for estimating conditional standard errors of prediction and Thorndike's difference method for estimating conditional standard errors of measurement were considered to estimate the standard error of measurement of an individual's driving behavior. The extent to which these two methods for estimating a standard error of measurement for an individual accurately assessed that error when compared to the actual variability of individual measurements was examined.
An Effective Pixel Rasterization Pipeline Architecture for 3D Rendering Processors
Authors: Woo-Chan Park, Kil-Whan Lee, Il-San Kim, Tack-Don Han, Sung-Bong Yang
Venue: IEEE Transactions on Computers (2003)

As a 3D scene becomes increasingly complex and the screen resolution increases, the design of an effective memory architecture is one of the most important issues for 3D rendering processors. We propose a pixel rasterization architecture that performs the depth test twice, before and after texture mapping. The proposed architecture eliminates memory bandwidth waste due to fetching unnecessary obscured texture data by performing the depth test before texture mapping. It also reduces the miss penalties of the pixel cache by using a prefetch scheme¿that is, a frame memory access, due to a cache miss at the first depth test, is done simultaneously with texture mapping. We have built a trace-driven simulator for the proposed architecture. To validate the proposed architecture, the results of various simulations are provided. The proposed pixel rasterization architecture achieves memory bandwidth effectiveness and reduces power consumption while producing high-performance gains.
Fast and flexible forwarding for Internet subscription systems
Authors: Joanna Kulik
Venue: Proceedings of the 2nd international workshop on Distributed event-based systems (2003)

This paper analyzes mechanisms for addressing and forwarding notifications in Internet subscription systems. The first section of the paper focuses on existing subscription systems, including single-identifier and content-based multicast approaches. It evaluates these systems on issues of subscription complexity, application-level flexibility, and efficiency and finds that both systems run into problems in these areas. The second section of the paper introduces an alternative to current approaches, called match-structure forwarding. In this approach, routers forward each message via a structure contained in the header of each message. These structures are specifically to reflect a variety of complex applications as well as for efficient forwarding by network routers. This paper proposes two alternative header formats for match-structure forwarding, called content lists and content graphs. The third section of the paper presents results from experiments that compared the performance of content lists and content graphs with other subscription systems. Results show that the match-structure forwarding approaches outperform other approaches in applications with large numbers of subscribers and overlapping subscription categories. Overall, these results suggest that match-structure forwarding systems are a promising development in the area of Internet Subscription Systems.
Governing Health Regions / Informing Board Members
Authors: Carolyn Green, Jochen Moehr, Marie Campbell
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Governing boards of Canadian regional health authorities report deficiencies and dissatisfaction with the information available for decision making. Given the importance of health personally and politically the potential impact of deficits is great. The ultimate goal of this study is the improvement of decision support for the governing boards of regionalized and vertically integrated health care systems. My immediate purpose is to understand how board members use information in decision making. This is required to both model the current communication and information use in decision processes, as well as, to design technologysolutions congruent with these. Institutional ethnography was explored as a way of doingsystematic inquiry as a preliminary step in the design process. This paper provides a methodological demonstration. Ethnographic fieldwork was conducted with one regional health board. Standard ethnographic data collection methods (observation, key informantinterviews, meeting transcripts and documentation) generated data that were analysed using a framework and method developed by Canadian social theorist Dorothy Smith. Taking the standpoint of the decision-maker and tracing information links to locations removed in time and space from the decision-making environments permits a roadmap of knowledge construction to emerge. Preliminary findings confirm that a sequential linear decision making process is notin evidence. The Board relies on the knowledge and contacts of board members to become concisely informed from sources external to the organization. More extensive information infrastructure is in the planning stages to support the Board but much analysis is currently ad hoc. A rich model of the dynamic interplay of work processes, professional discourses, institutional complexes and various knowledge practices, beliefs and ideologies is made visible. The insights gained in this investigation will be used as a basis for developing strategies to improve the effective use of information and communication technologies for decision support.
The Writer Independent Online Handwriting Recognition System frog on hand and Cluster Generative Statistical Dynamic Time Warping
Authors: Claus Bahlmann, Hans Burkhardt
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we give a comprehensive description of our writer-independent online handwriting recognition system frog on hand. The focus of this work concerns the presentation of the classification/training approach, which we call cluster generative statistical dynamic time warping (CSDTW). CSDTW is a general, scalable, HMM-based method for variable-sized, sequential data that holistically combines cluster analysis and statistical sequence modeling. It can handle general classification problems that rely on this sequential type of data, e.g., speech recognition, genome processing, robotics, etc. Contrary to previous attempts, clustering and statistical sequence modeling are embedded in a single feature space and use a closely related distance measure. We show character recognition experiments of frog on hand using CSDTW on the UNIPEN online handwriting database. The recognition accuracy is significantly higher than reported results of other handwriting recognition systems. Finally, we describe the real-time implementation of frog on hand on a Linux Compaq iPAQ embedded device.
On the harmonious mating strategy through tabu search
Authors: Chuan-Kang Ting, Sheng-Tun Li, Chungnan Lee
Venue: Information Sciences: an International Journal (2003)

Genetic algorithms (GAs) are well-known heuristic algorithms and have been applied to solve a variety of complicated problems. When adopting GA approaches, two important issues--selection pressure and population diversity--must be considered. This work presents a novel mating strategy, called tabu genetic algorithm (TGA), which harmonizes these two issues by integrating tabu search (TS) into GA's selection. TGA incorporates the tabu list to prevent inbreeding so that population diversity can be maintained, and further utilizes the aspiration criterion to supply moderate selection pressure. An accompanied self-adaptive mutation method is also proposed to overcome the difficulty of determining mutation rate, which is sensitive to computing performance. The classic traveling salesman problem is used as a benchmark to validate the effectiveness of the proposed algorithm. Experimental results indicate that TGA can achieve harmony between population diversity and selection pressure. Comparisons with GA, TS, and hybrids of GA and TS further confirm the superiority of TGA in terms of both solution quality and convergence speed.
Modelling a flexible network security systems using multi-agents systems: security assessment considerations
Authors: Gustavo A. Santana Torrellas, Luis A. Villa Vargas
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Recent developments have made it possible to interoperate complex business applications at much lower costs. Application interoperation, along with business process reengineering can result in significant savings by eliminating work created by disconnected business processes due to isolated business applications. However, we believe much greater productivity benefits can be achieved by facilitating timely decision-making, utilizing information from multiple enterprise perspectives. To stay competitive in this current scenario, it is crucial for organizations to react quickly to changing security factors, such as virus attack, active intrusion, new technologies, and cost of disaster recovery. Such information security changes often encourage the creation of new security schemas or security improvements. Accommodating frequent systems information changes requires a network security system be more flexible than currently prevalent systems. Consequently, there has recently been an increasing interest in flexible network security and disaster recovery systems.
A Finite Volume Scheme for a Noncoercive Elliptic Equation with Measure Data
Authors: Jérôme Droniou, Thierry Gallouët, Raphaèle Herbin
Venue: SIAM Journal on Numerical Analysis (2003)

We show here the convergence of the finite volume approximate solutions of a convection-diffusion equation to a weak solution, without the usual coercitivity assumption on the elliptic operator and with weak regularity assumptions on the data. Numerical experiments are performed to obtain some rates of convergence in two and three space dimensions.
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region
Authors: C. M. Kyung, J. M. Widder, D. A. Mlynski
Venue: Proceedings of the conference on European design automation (1990)

A new algorithm for circuit packing (or detailed placement) in any rectilinear region called Adaptive Cluster Growth (ACG) is described in analogy to the growth of a low-stress crystal in a cavity of any given shape. ACG is an algorithm suitable for packing of circuit modules, either standard cell or macro cell, in a rectilinear region by refining the result of global placement obtained by such techniques as Force-Directed Relaxation (FDR) or Force-and-Cut placement (FOCUP). The overlaps among modules or overlaps between any module and chip boundary are removed, which exist in the global placement result, are removed in ACG in such a way that the estimation of the total routing length is kept as low as possible. Our experiment with standard cell circuits in Benchmark data has shown that ACG outperforms or performs close to other packing techniques, which are applicable only for rectangular region, even in rectangular region case. Examples are shown to demonstrate the packing of standard cell circuits in arbitrary-shaped regions. An efficient tiling scheme for representing the rectilinear-shaped cluster and region boundary is also described.
Role of behavioral factors in strategic alliances
Authors: Chong Kim, Purnendu Mandal, Dale H. Shao
Venue: Computing information technology: the human side (2003)

The number of strategic alliances formed between organizations has increased dramatically and are projected to continue increasing over the next few years. Behavioral and cultural factors play a major role in the success (or failure) of a strategic alliance between partners, but many managers pay little attention to this aspect while in the process of negotiations. This paper highlights a number of human and organizational culture issues, which played a major role in the process of developing a strategic alliance between a major telecommunications organization and several retail electricity organizations. A framework for strategic alliance was developed for this new market situation, which helped the organizations involved understand the future informational requirements and dependence of the partners on one another.
Indexing, searching, and skimming of multimedia documents containing recorded lectures and live presentations
Authors: Wolfgang Hürst
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This demonstration illustrates different ways to support users dealing with recorded live presentations in order to improve the usability of the corresponding documents. It highlights different problems in this context and presents solutions and alternative approaches for both, multimedia indexing and query processing as well as user interface issues in order to support users who are skimming or browsing such documents in search for information.
IS Project Selection: The Role of Strategic Vision and IT Governance
Authors: Susan A. Sherer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The prioritization of information systems projects is a function of the strategic vision of the organization. We develop a model of the IT selection process that is based upon the influence of strategic vision. Strategic vision influences both the type of projects considered, the resources allocated to information systems, and the processes and mechanisms for justifying IT investments. Two of the processes that influence the final project selection are the reporting structure of the IS organization and the involvement of a steering committee for investment prioritization. We suggest that this influences the criteria used to make IT investment decisions.
Capacity Management in Decentralized Networks
Authors: Yasushi Masuda, Seungjin Whang
Venue: Management Science (2002)

Bottleneck analysis is a useful tool in capacity planning for centrally controlled network systems. However, under a decentralized network where individual users are allowed to select their own routes, straightforward application of bottleneck analysis does not necessarily yield an optimal performance. It may even hurt the system performance--an aspect of Braess's paradox. We investigate the capacity expansion problem for a decentralized system with general network topology. To this end, we first discuss the short-run problem and show that the externality pricing solves the joint problem of demand and routing control. We then study the capacity expansion/reduction problem for decentralized systems that may or may not be optimally controlled in the short run.
Efficient data mining for calling path patterns in GSM networks
Authors: Anthony J. T. Lee, Yao-Te Wang
Venue: Information Systems (2003)

In this paper, we explore a new data mining capability that involves mining calling path patterns in global system for mobile communication (GSM) networks. Our proposed method consists of two phases. First, we devise a data structure to convert the original calling paths in the log file into a frequent calling path graph. Second, we design an algorithm to mine the calling path patterns from the frequent calling path graph obtained. By using the frequent calling path graph to mine the calling path patterns, our proposed algorithm does not generate unnecessary candidate patterns and requires less database scans. If the corresponding calling path graph of the GSM network can be fitted in the main memory, our proposed algorithm scans the database only once. Otherwise, the cellular structure of the GSM network is divided into several partitions so that the corresponding calling path sub-graph of each partition can be fitted in the main memory. The number of database scans for this case is equal to the number of partitioned sub-graphs. Therefore, our proposed algorithm is more efficient than the PrefixSpan and a priori-like approaches. The experimental results show that our proposed algorithm outperforms the a priori-like and PrefixSpan approaches by several orders of magnitude.
Enhancing apprentice-based learning of Java
Authors: Michael Kölling, David J. Barnes
Venue: ACM SIGCSE Bulletin (2004)

Various methods have been proposed in the past to improve student learning by introducing new styles of working with assignments. These include problem-based learning, use of case studies and apprenticeship. In most courses, however, these proposals have not resulted in a widespread significant change of teaching methods. Most institutions still use a traditional lecture/lab class approach with a strong separation of tasks between them. In part, this lack of change is a consequence of the lack of easily available and appropriate tools to support the introduction of new approaches into mainstream courses.In this paper, we consider and extend these ideas and propose an approach to teaching introductory programming in Java that integrates assignments and lectures, using elements of all three approaches mentioned above. In addition, we show how the BlueJ interactive programming environment [7] (a Java development environment aimed at education) can be used to provide the type of support that has hitherto hindered the widespread take-up of these approaches. We arrive at a teaching method that is motivating, effective and relatively easy to put into practice. Our discussion includes a concrete example of such an assignment, followed by a description of guidelines for the design of this style of teaching unit.
Experiments in Automatic Programming for General Purposes
Authors: Marek Reformat, Chai Xinwei, James Miller
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Although the generation and application of software clones is relatively unexplored, it is believed that this is a fundamental technology that can have many different applications within a software engineering environment. For example, software clones could be used in softwarefault tolerance.Clearly, for these clones to be usable, their production needs to be automated. An interesting approach to this automatic production or generation problem is the application of evolutionary-based Genetic Programming (GP). Using the paradigms of best fit, selection, crossover and mutation a number of clones, satisfying specific requirements, can be automatically generated. In general, GP is a flexible and powerful algorithm suitable for solving variety of different problems. The paper presents the results of studies that have been conducted in order to answer questions related to feasibility of using GP for clone generation: what features of GP are important? What works and what does not? How GP can be "tuned" for the problem? The results have been used to draw a set of suggestions and conclusions that indicate possible usability of GP-based approach to automatic generation of clones.
ESD protection for the deep sub micron regime - a challenge for design methodology
Authors: Harald Gossner
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

ESD protection has been an inevitablecomponent of integrated circuits since theinvention of semiconductor devices. Ahuge number of concepts and protectiondevices have be designed and optimizedfor this purpose by ESD engineers. Even itseems to be a simple functionality just toshunt a discharge current during an ESDevent, almost each step in the shrinkingpath needs new adjustment of theprotection circuits and sometimes evenimplementation of totally new concepts.Entering the sub 100 nm regime the protectiondevelopment goes much beyond thedevelopment of a specific optimizedprotection element. A sophisticated protectionnetwork has to be designed whichcovers both the IO circuit and the coreregion, where low oxides thickness and lowjunction breakdown voltages lead to hardconstraints on the maximum voltageovershoot during ESD. In especiallydesigns with multiple power supplydomains will complicate the ESD supplyprotection concept extremely. To achieve agood ESD robustness it will be necessaryto consider the ESD protection as integralpart of the IC development starting from theconcept phase. To support this and toextract the necessary data for an ESDoptimization an IC level ESD simulationapproach is presented which analyses thecritical discharge paths across the chip.
Poster abstract: serial data aggregation using space-filling curves in wireless sensor networks
Authors: Swapnil Patil, Samir R. Das
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Many applications require that sensor observations in a given geographic region be aggregated or fused in a serial fashion. This requires a routing path to be constructed through all sensors in that region. This paper investigates efficient network traversal techniques to construct such path using the novel concept of space-filling curves.
Number Theoretic Designs for Directed Regular Graphs of Small Diameter
Authors: William D. Banks, Alessandro Conflitti, Igor E. Shparlinski
Venue: SIAM Journal on Discrete Mathematics (2004)

In 1989, F. R. K. Chung gave a construction for certain directed h-regular graphs of small diameter. Her construction is based on finite fields, and the upper bound on the diameter of these graphs is derived from bounds for certain very short character sums. Here we present two similar constructions that are based on properties of discrete logarithms and exponential functions in residue rings modulo a prime power. Accordingly, we use bounds for certain sums with additive and multiplicative characters to estimate the diameter of our graphs. We also give a third construction that avoids the use of bounds for exponential sums.