ppxscal/embedding_network huggingface dataset:
Kinetic simulation tools for nano-scale semiconductor devices
Authors: Alex Fedoseyev, Vladimir Kolobov, Robert Arslanbekov, Andrzej Przekwas
Venue: Microelectronic Engineering (2003)

Kinetic simulation tools for design of nano devices based on deterministic solution of the classical Boltzmann equation with quantum corrections are described. We used two-term spherical harmonic expansion in velocity space, reducing the Boltzmann equation for electrons to a Fokker-Planck equation in a four-dimensional space (three spatial coordinates and energy). Details of the numerical implementation of the four-dimensional Fokker-Planck solver using kinetic and total energy domains are presented. The effect of quantum corrections on spatial distribution of carriers is taken into account. Simulation results for the nonlocal nonequilibrium electron transport, short submicron n+nn+ Si diode, quantum single barrier problem, and ultra-small "well tempered NMOSFET" are presented and compared with drift-diffusion, experimental and other author results. The numerical method employed is the finite volume technique with time-splitting factorization of spatial and energy space transport.
Parametrized semantics of logic programs: a unifying framework
Authors: Yann Loyer, Nicolas Spyratos, Daniel Stamate
Venue: Theoretical Computer Science (2003)

The different semantics that can be assigned to a logic program correspond to different assumptions made concerning the atoms that are rule heads and whose logical values cannot be inferred from the rules. For example, the well founded semantics corresponds to the assumption that every such atom is false, while the Kripke-Kleene semantics corresponds to the assumption that every such atom is unknown. In this paper, we propose to unify and extend this assumption-based approach by introducing parameterized semantics for logic programs. The parameter holds the value that one assumes for all rule heads whose logical values cannot be inferred from the rules. We work within multi-valued logic with bilattice structure, and we consider the class of logic programs defined by Fitting.Following Fitting's approach, we define an operator that allows us to compute the parameterized semantic, and to compare and combine semantics obtained for different values of the parameter. We show that our approach captures and extends the usual semantics of conventional logic programs thereby unifying their computation.
Preconditioning conjugate gradient with symmetric algebraic reconstruction technique (ART) in computerized tomography
Authors: Reginaldo J. Santos
Venue: Applied Numerical Mathematics (2003)

We apply the conjugate gradient method to the system At Cω-t Cω-1 Ax = At Cω-t Cω-1 b, where Cω = (D + ωL)D-1/2 and AAt = L + D + Lt. This corresponds to applying CG to the generalized least square problem min||Cω-1 (Ax - b)||. We use an efficient way to compute the expressions AtCω-t r and Cω-1 Aw using only the rows of A.
Asymptotics of the Hurwitz Binomial Distribution Related to Mixed Poisson Galton&ndash;Watson Trees
Authors: Jürgen Bennies, Jim Pitman
Venue: Combinatorics, Probability and Computing (2001)

Hurwitz's extension of Abel's binomial theorem defines a probability distribution on the set of integers from 0 to n. This is the distribution of the number of non-root vertices of a fringe subtree of a suitably defined random tree with n + 2 vertices. The asymptotic behaviour of this distribution is described in a limiting regime in which the fringe subtree converges in distribution to a Galton&ndash;Watson tree with a mixed Poisson offspring distribution.
Dispatching in perfectly-periodic schedules
Authors: Zvika Brakerski, Vladimir Dreizin, Boaz Patt-Shamir
Venue: Journal of Algorithms (2003)

In a perfectly-periodic schedule, time is divided into time-slots, and each client gets a time slot precisely every predefined number of time slots, called the period of that client. Periodic schedules are useful in mobile communication where they can help save power in the mobile device, and they also enjoy the best possible smoothness. In this paper we study the question of dispatching in a perfectly periodic schedule, namely how to find the next item to schedule, assuming that the schedule is already given somehow. Simple dispatching algorithms suffer from either linear time complexity per slot or from exponential space requirement. We show that if the schedule is given in a natural tree representation, then there exists a way to get the best possible running time per slot for a given space parameter, or the best possible space (up to a polynomial) for a given time parameter. We show that in many practical cases, the running time is constant and the space complexity is polynomial.
Designing e-business and e-commerce courses to meet industry needs
Authors: Anthony D. Stiller
Venue: Current issues in IT education (2003)

This chapter is designed to assist undergraduate program developers in designing and developing courses that will better prepare graduates to have a balanced mix of e-business, e-commerce, communication, and leadership skills that will equip them for roles as consultants for small-to-medium enterprises. Because small-to-medium enterprises do not have a vast budget or knowledge of e-commerce development, they are more likely to contract a consultant within their local community rather than contract a larger consulting firm that is more likely to have a number of staff members with a variety of specialist skills. This being the case, undergraduate courses must equip our professionals with skills sets that focus on e-business strategic planning as well as the e-commerce technology skills that will enable them to design, develop, and implement e-business strategies that meet the needs of small-to-medium enterprises by understanding the environments in which they operate.
On traversal sequences, exploration sequences and completeness of kolmogorov random strings
Authors: Michal Koucky
Venue:  (2003)

Traversal sequences were defined by Aleliunas et al. (1979) as a tool for the study of undirected s-t-connectivity. In the first part of this thesis we study traversal sequences. We improve on previous results and we present a simple construction of polynomial length universal traversal sequences for 2-regular graphs. These universal traversal sequences are log-space (even NC1) constructible and are of length O(n4.03). Further, we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the original traversal sequences but they also exhibit some new properties. For instance, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. We present simple constructions of polynomial length universal exploration sequences for several classes of graphs, e.g., 2-regular graphs, cliques, expanders, trees. These constructions do not obey previously known lower bounds on the length of universal traversal sequences thus, they highlight another difference between exploration and traversal sequences. We also show that universal traversal sequences can be efficiently converted into universal exploration sequences. Further, we show certain self-correcting properties of traversal and exploration sequences and we propose a candidate universal exploration sequence. In the second part of this thesis we study Kolmogorov complexity, which is a measure of randomness of finite strings, and its resource-bounded variants. We show that sets consisting of strings of high resource-bounded Kolmogorov complexity provide examples of sets that are complete for complexity classes in which they naturally lie under probabilistic and non-uniform reductions whereas they are provably not complete under the usual many-one reductions. Further, our results imply that under certain intractability assumptions, resource-bounded Kolmogorov complexity of a string as well as circuit size, formula size and branching program size of a Boolean function can not be efficiently approximated. We also study unbounded Kolmogorov complexity. We show completeness results in that setting and point out certain inconsistencies caused by the usual definition of Kolmogorov complexity. We also consider the problem of deterministically generating a Kolmogorov random string when the set of Kolmogorov random strings is given to us as an oracle.
Face recognition: A literature survey
Authors: W. Zhao, R. Chellappa, P. J. Phillips, A. Rosenfeld
Venue: ACM Computing Surveys (CSUR) (2003)

As one of the most successful applications of image analysis and understanding, face recognition has recently received significant attention, especially during the past several years. At least two reasons account for this trend: the first is the wide range of commercial and law enforcement applications, and the second is the availability of feasible technologies after 30 years of research. Even though current machine recognition systems have reached a certain level of maturity, their success is limited by the conditions imposed by many real applications. For example, recognition of face images acquired in an outdoor environment with changes in illumination and/or pose remains a largely unsolved problem. In other words, current systems are still far away from the capability of the human perception system.This paper provides an up-to-date critical survey of still- and video-based face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into the studies of machine recognition of faces. To provide a comprehensive survey, we not only categorize existing recognition techniques but also present detailed descriptions of representative methods within each category. In addition, relevant topics such as psychophysical studies, system evaluation, and issues of illumination and pose variation are covered.
Structural-based testing methodologies for visual dataflow languages
Authors: Trevor Smedley
Venue:  (2000)

Visual dataflow programming languages have become an important topic of research in recent years, yielding a variety of research systems and commercial applications [9] [10] [21] [80]. As with any programming language, be it visual or textual, programs written in visual dataflow languages like Prograph may contain faults. Thus, to ensure the correct functioning of visual dataflow programs, testing is required. Despite this valid observation, we find no discussion in the literature that addressed a specific testing methodology for visual dataflow programs. We did find, however, adequate discussions related to testing methodologies for imperative, declarative, and form-based languages. In this thesis, we investigated, from structural testing perspectives, differences between imperative and visual dataflow languages. Our investigations revealed opportunities to adapt code-based structural testing to test visual dataflow languages. Based on that adaptation, we have developed an integrated Dataflow Testing Tool (DFTT) and used it to visually and empirically validate our testing results. Those results showed that our structural-based testing methodology, in particular the &ldquo;All-du paths&rdquo; testing, provide an important error detection ability in visual dataflow languages. To communicate the testedness of a visual dataflow program, we provided a visual testing and validating environment in the DFTT by using visual annotations to reflect, based on a certain testing criterion, the testedness of an operation, a predicate operation, or a datalink. We also investigated from a data-flow testing perspective, differences between code-based object oriented languages and visual object-flow languages in the context of Prograph. Our findings revealed that, analogous to code-based object oriented languages, there are three levels of testing instance variable data-flow interactions in visual object-flow languages. In each level we showed how code-based data-flow testing techniques can be adapted to collect that level's appropriate du-chains. As for our new research directions, we have proposed an Integrated Testing and Visual Validating Environment (ITVVE) for imperative languages that allows users/testers to visualize both tested and untested du-associations. We also showed that the ITVVE provides a visual testing environment that facilitates the task of approximating the location of errors in the code.
Assessing explicit error reporting in the narrative electronic medical record using keyword searching
Authors: Hui Cao, Peter Stetson, George Hripcsak
Venue: Journal of Biomedical Informatics (2003)

Background. Many types of medical errors occur in and outside of hospitals, some of which have very serious consequences and increase cost. Identifying errors is a critical step for managing and preventing them. In this study, we assessed the explicit reporting of medical errors in the electronic record.Method. We used five search terms "mistake," "error," "incorrect," "inadvertent," and "iatrogenic" to survey several sets of narrative reports including discharge summaries, signout notes, and outpatient notes from 1991 to 2000. We manually reviewed all the positive cases and identified them based on the reporting of physicians.Result. We identified 222 explicitly reported medical errors. The positive predictive value varied with different keywords. In general, the positive predictive value for each keyword was low, ranging from 3.4 to 24.4%. Therapeutic-related errors were the most common reported errors and these reported therapeutic-related errors were mainly medication errors.Conclusion. Keyword searches combined with manual review indicated some medical errors that were reported in medical records. It had a low sensitivity and a moderate positive predictive value, which varied by search term. Physicians were most likely to record errors in the Hospital Course and History of Present Illness sections of discharge summaries. The reported errors in medical records covered a broad range and were related to several types of care providers as well as non-health care professionals.
Providing the basis for human-robot-interaction: a multi-modal attention system for a mobile robot
Authors: Sebastian Lang, Marcus Kleinehagenbrock, Sascha Hohenner, Jannik Fritsch, Gernot A. Fink, Gerhard Sagerer
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

In order to enable the widespread use of robots in home and office environments, systems with natural interaction capabilities have to be developed. A prerequisite for natural interaction is the robot's ability to automatically recognize when and how long a person's attention is directed towards it for communication. As in open environments several persons can be present simultaneously, the detection of the communication partner is of particular importance. In this paper we present an attention system for a mobile robot which enables the robot to shift its attention to the person of interest and to maintain attention during interaction. Our approach is based on a method for multi-modal person tracking which uses a pan-tilt camera for face recognition, two microphones for sound source localization, and a laser range finder for leg detection. Shifting of attention is realized by turning the camera into the direction of the person which is currently speaking. From the orientation of the head it is decided whether the speaker addresses the robot. The performance of the proposed approach is demonstrated with an evaluation. In addition, qualitative results from the performance of the robot at the exhibition part of the ICVS'03 are provided.
Lifestyles of Virtual World Residents, Living in the on-line game, "Lineage"
Authors: Leo Sang-Min Whang, Geun-Young Chang
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This study attempted to explore different lifestyles ofgame players who have adopted the virtual world as partof their life in the online game world. An online surveywas conducted to the players of one of famous Internetbased games called 'Lineage'. 'Lineage' has become thebiggest online game in the world accommodating over 6million users worldwide, where people create his or hernew identities and play various roles. 4,786 game playershave participated in the survey, and their lifestyles wereidentified with their values and attitudes in the virtualworld. Upon classification of their lifestyles, thebehavioral tendencies and characteristic desires werecompared by the lifestyles in virtual world. The studyshowed that game players have developed their owndistinctive lifestyles, and the lifestyles were strongcriterion on explaining the behavior patterns and theirdifferent desire to achieve in the world among them. Thelifestyles were classified into three general categories;Single-Oriented Player, Community-Oriented Player, Off-realWorld Gamer. Each group displayed distinctdifferences in their values and game activities, as well asanti-social behavior tendencies. The differences werereflecting not only their personality but also their socio-economicstatus within the virtual world that isconstructed through the game activities. This study hopesto serve as a model to understand how players fromdifferent real life backgrounds will behave to the variousgame features and how they adopt the virtual world fortheir new social identities.
On the First Price Spike in Summer
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The objective of this paper is to determine why price spikes occur in deregulated wholesale markes for electricity, and how effectively they can be mitigated by different modifications to the market. The analysis employs a multi-agent system (MAS) to replicate a spot market with six supply firms, represented by adaptive autonomous agents. These firms submit offers to maximize their own expected profits, and an Independent System Operator (ISO) clears the market for a predetermined load in a uniform price auction. The firms learn about the market and the behavior of their competitors by comparing actual market outcomeswith predicted outcomes based on an estimate of their own residual demand curve. This estimated demand curve is updated each period using a Kalman filter.The main results for creating price spikes are 1) uncertainty about the system load is an important determinant of observed behavior (i.e. offer curves shaped like a hockey stick) that is replicated in the MAS, and 2) all firms eventually become speculators, and it is unrealistic to expect firms to behave like price takers in a market with six suppliers. The main results formitigating high prices are 1) it is impractical to rely on more suppliers, vertically integrated firms, capacity payments or fixed contracts for power to eliminate speculative behavior, and 2) price responsive load is an effective way to mitigate high prices, particularly if some load responds at relatively low prices. Overall, the results show that a MAS can be used to evaluate a wide range of policy options and supplement the results of market tests using human subjects.
Size-aware scheduling of tcp flows
Authors: Liang Guo
Venue:  (2003)

Internet flow sizes are skewed: there are many small sized flows (or &ldquo;mice&rdquo;) and a few extremely large flows (or &ldquo;elephants&rdquo;). However, most of the Internet traffic is due to these elephant flows. Previous job scheduling studies show that with such skewed distribution, a scheduling policy such as Shortest Job First (SJF), that gives high priority to short jobs, can significantly reduce the overall average response time with almost no penalty to large jobs. The primary contribution of this thesis is the design, modeling, and performance evaluation of a scheduling policy that mimics SJF scheduling by implementing additional functionality at Internet routers. The focus is on scheduling flows controlled by the popular Transmission Control Protocol (TCP). Since routers do not have advanced knowledge of flow sizes, the scheme simply monitors incoming packets/bytes and assigns lower priority to flows that have already sent more than a certain amount of packets. Two analytical models are developed in this thesis. One uses the Multi-Level (ML) feedback queueing model to characterize the threshold-based prioritization scheme, under the assumption of ideal bandwidth sharing among flows. An approximate analysis of this ML model is given to derive closed-form solutions to the average response time. The second model uses a numerical method to analyze a more realistic but less tractable bandwidth sharing model achieved by TCP. These models serve as stepping-stones for the development of an adaptive controller for parameterizing the proposed control system. The analytical and numerical results are validated with packet-level simulations and testbed experiments. The experimental prototype is implemented over the Linux netfilter Application Programming Interface over a wide-area network testbed. The proposed size-aware differentiated scheduling scheme fits into a scalable architecture of Internet Traffic Managers (ITMs), where routers with enhanced functionalities (the ITMs) are deployed at strategic places in the Internet. Practical implementation issues such as incremental deployment and scalability of the size-aware scheduling through ITMs are also studied in this thesis. A random sampling mechanism is developed to reduce the implementation complexity of the threshold-based flow classification scheme at the ITMs. The effectiveness of the sampling mechanism and incremental deployment are highlighted by simulation results.
Improving Fact Extraction of Framework-Based Software Systems
Authors: Jens Knodel, Martin Pinzger
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Modern software frameworks provide a set of commonand prefabricated software artifacts that supportengineers in developing large-scale software systems.Framework-related information can be implemented insource code, comments or configuration files, but in thelatter two cases, current reverse engineering approachesmiss important facts reducing the quality of subsequentanalysis tasks. We introduce a generic fact extractionapproach for framework-based systems by combiningtraditional parsing with lexical pattern matching toobtain framework-specific facts from all three sources.We evaluate our approach with an industrial softwareapplication that was built using the Avalon/Phoenixframework. In particular we give examples to point outthe benefits of considering framework-related informationand reflect experiences made during the case study.