ppxscal/embedding_network huggingface dataset:
Genetic programming for robot vision
Authors: Martin C. Martin
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Genetic Programming was used to create the vision subsystem of a reactive obstacle avoidance system for an autonomous mobile robot. The representation of algorithms was specifically chosen to capture the spirit of existing, hand written vision algorithms. Traditional computer vision operators such as Sobel gradient magnitude, median filters and the Moravec interest operator were combined arbitrarily. Images from an office hallway were used as training data. The evolved programs took a black and white camera image as input and estimated the location of the lowest non-ground pixel in a given column. The computed estimates were then given to a handwritten obstacle avoidance algorithm and used to control the robot in real time. Evolved programs successfully navigated in unstructured hallways, performing on par with hand-crafted systems.
Current issues in packet switch design
Authors: Cyriel Minkenberg, Ronald P. Luijten, François Abel, Wolfgang Denzel, Mitchell Gusat
Venue: ACM SIGCOMM Computer Communication Review (2003)

Addressing the ever growing capacity demand for packet switches, current research focuses on scheduling algorithms or buffer bandwidth reductions. Although these topics remain relevant, our position is that the primary design focus for systems beyond 1 Tb/s must be shifted to aspects resulting from packaging disruptions. Based on trends such as increased link rates and improved CMOS technologies, we derive new design factors for such switch fabrics. For instance, we argue that the packet round-trip transmission time within the fabric has become a major design parameter. Furthermore, we observe that high-speed fabrics have become extremely dependent on serial I/O technology that is both high speed and high density. Finally, we conclude that in developing the architecture, packaging constraints must be put first and not as an afterthought, which also applies to solving the tremendous power consumption challenges.
FasTLInC: a constraint-based tracing approach
Authors: Ann Q. Gates, Oscar Mondragon
Venue: Journal of Systems and Software (2002)

In an approach to software monitoring called Dynamic Monitoring with Integrity Constraints (DynaMICs), integrity constraints are used to monitor program behavior at runtime. The constraints capture domain knowledge, limitations imposed by the design, and assumptions made by programmers. This paper introduces Fast Tracing with Links using Integrity Constraints (FasTLInC), a component of DynaMICs, that manages integrity-constraint specifications, software artifacts, and program state information, permitting tracing of constraints and artifacts, specifically requirements and source code. Because DynaMICs verifies that a program behaves in accordance to constraints, the traceability provided by FasTLInC is significant since the monitor targets the detection of faults that result from ambiguity and changes in requirements, conflicts among requirements, and change in program use. The automated identification of bi-directional links between constraints and code eliminates the laborious task of managing links, which can be problematic because of the evolutionary nature of code.
A Dynamic Model for Airline Seat Allocation with Passenger Diversion and No-Shows
Authors: Wen Zhao, Yu-Sheng Zheng
Venue: Transportation Science (2001)

For airlines selling the same seats on a scheduled flight at different fares, the demand for a fare class is affected not only by the current availability of lower fares but also by the possibility of future availability of them. To address this type of passenger behavior, this paper studies a two-class dynamic seat allocation model, which has two distinctive features. The model assumes first that the discount fare cannot be reopened once closed and, second, that a fraction of the customers are flexible, i.e., while willing to pay the full fare, they would buy discount fare tickets if available. These assumptions not only reflect customers' behavior but also are consistent with a class of existing static models that are widely accepted by the industry.For this model, we derive structural properties of the optimal policy. We show that the optimal policy is a threshold policy: The discount fare should be closed as soon as the number of seats remaining reaches a predetermined threshold, which is a function of the time remaining before departure. We show that the threshold does not always decrease over time, and that its time-monotonicity depends on how the proportion of flexible customers changes over time. Our model explains why airlines close discount fares as the departure time approaches. We also show a close relationship between the optimal policy and the policies suggested by the existing static models (the Littlewood rule and its variants). Our numerical study shows that, for parameters plausible to real applications, the latter policies, although not optimal for our dynamic model, perform well, compared to the performance of the optimal policies.
Grid refinement/alignment in 3D flow computations
Authors: Jiří Felcman
Venue: Mathematics and Computers in Simulation (2003)

The paper is concerned with the grid refinement/coarsening/alignment technique for the adaptive solution of the 3D compressible flow. The necessary condition for the properties of the tetrahedrization on which the discretization error is below the prescribed tolerance is formulated. The interpolation error in the density and in the Mach number for the inviscid and viscous flow, respectively, is used to control this necessary condition. The original smoothing procedure for the generally discontinuous approximate solution is proposed in terms of edge based Hesse matrices. This allows to define the concept of the optimal mesh and to adopt the standard anisotropic mesh adaptation technique for the equidistribution of the interpolation error function. Geometrically interpreted, the optimal mesh is almost equilateral tetrahedrization with respect to the solution dependent Riemann norm of edges. For its construction, the iterative algorithm is proposed. The theoretical considerations are completed by the numerical example of the adaptive solution of the 3D channel flow.
Research Report: Intrafirm Resource Allocation with Asymmetric Information and Negative Externalities
Authors: Raja Nadiminti, Tridas Mukhopadhyay, Charles H. Kriebel
Venue: Information Systems Research (2002)

We examine the intrafirm resource allocation problem with the following characteristics. The resource exhibits negative externalities, and the benefit of using the resource is known only to the user department and not to top management or other user departments. In addition, the consumption of the resource depends upon the choice of the mechanism for allocating the resource. For this problem, we derive a two-stage mechanism, and show that this proposed mechanism leads to optimal allocation.
A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
Authors: Agostino Nuzzolo, Francesco Russo, Umberto Crisalli
Venue: Transportation Science (2001)

In order to improve the performances of transit modeling and in particular to assess the effects of the introduction of ITS technologies, which imply substantial changes in user behavior, in the last 10 years transit path choice and assignment models that use a schedule-based approach, instead of the traditional frequency-based one, have been developed. This paper presents a schedule-based path choice model for high-frequency transit networks, which allows us to consider the evolution in time of transit services, both within-day and day-to-day, as well as the day-to-day learning process of attributes by which users choose. On the basis of this path choice model a dynamic process assignment model, both within-day and day-to-day (from which the term "doubly dynamic" derives), was developed and tested on a realistically sized network to verify its applicability for operations planning.
A template model for multidimensional inter-transactional association rules
Authors: Ling Feng, Jeffrey Xu Yu, Hongjun Lu, Jiawei Han
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2002)

Multidimensional inter-transactional association rules extend the traditional association rules to describe more general associations among items with multiple properties across transactions. &ldquo;After McDonald and Burger King open branches, KFC will open a branch two months later and one mile away&rdquo; is an example of such rules. Since the number of potential inter-transactional association rules tends to be extremely large, mining inter-transactional associations poses more challenges on efficient processing than mining traditional intra-transactional associations. In order to make such association rule mining truly practical and computationally tractable, in this study we present a template model to help users declare the interesting multidimensional inter-transactional associations to be mined. With the guidance of templates, several optimization techniques, i.e., joining, converging, and speeding, are devised to speed up the discovery of inter-transactional association rules. We show, through a series of experiments on both synthetic and real-life data sets, that these optimization techniques can yield significant performance benefits.
Experimental study of affect bursts
Authors: Marc Schröder
Venue: Speech Communication (2003)

The study described here investigates the perceived emotional content of "affect bursts" for German. Affect bursts are defined as short emotional non-speech expressions. This study shows that affect bursts, presented without context, can convey a clearly identifiable emotional meaning. The influence of the segmental structure on emotion recognition, as opposed to prosody and voice quality, is investigated. Agreement between transcribers is used as an experimental criterion for distinguishing between reflexive raw affect bursts and conventionalised affect emblems. A detailed account of 28 affect burst classes is given, including perceived emotion and recognition rate in listening and reading perception tests as well as a phonetic transcription of segmental structure, voice quality and intonation.
Optimization and synthesis for complex reactive embedded systems by incremental collapsing
Authors: Massimiliano Chiodo
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

We propose a software synthesis procedure for reactive real-time embedded systems. In our approach, control parts of the system are represented in a decomposed form enabling more complex control structures to be represented. We propose a synthesis procedure for this representation that incrementally aggregates elements of the representation while keeping the resulting code size under tight control. This method combined with heuristic strategies works very well on real-life designs and demonstrates the potential to produce results that challenge or beat hand-written implementations.
GAP: A General Approach to Quantitative Diagnosis of Performance Problems
Authors: Joseph L. Hellerstein
Venue: Journal of Network and Systems Management (2003)

Quantitative performance diagnosis (QPD) provides explanations that quantify the impact of problem causes. An example of such an explanation is it Increased web server traffic accounts for 90% of the increase in LAN utilization, which in turn accounts for 20% of the increase in web response times. This paper describes GAP, a general approach to quantitative performance diagnosis. GAP has two parts: (1) an algorithm for computing quantitative performance diagnoses&semi; and (2) a framework for constructing diagnostic techniques that provides the basis for quantifications produced by the algorithm. The GAP algorithm makes use of a measurement navigation graph, a directed acyclic graph whose nodes are measurement variables and whose arcs have weights that quantify the effect of child variables (e.g., LAN utilization) on parent variables (e.g., response time). The framework for developing diagnostic techniques consists of (a) the choice of statistic (e.g., mean, variance) to aggregate problem values, and (b) the estimator of the statistic.
Application service provider aggregation architecture
Authors: Christoph Bussler
Venue: Web-enabled systems integration: practices and challenges (2003)

Application service providers (ASPs) are a new type of service providers that make the whole spectrum from low-end applications like e-mail systems to high-end applications like enterprise resource planning (ERP) management systems available to customers over the Internet through browser-based user interfaces (application hosting). This relieves a customer from installing and managing the applications himself in his own data center. Instead, the customer pays a fee for accessing the application over the Internet. However, as soon as a customer uses several applications hosted by different ASPs, a management burden arises for the customer as well as an application integration problem, since the applications are hosted individually by several ASPs without any coordination or data exchange between them. The arising integration (aggregation) problems are discussed in this chapter. An ASP aggregation architecture is defined based on B2B integration servers that address these problems by supporting the seamless access and seamless integration of all hosted applications hiding the differences between the ASPs.
A genetic algorithm approach to automated custom document assembly
Authors: Lisa Purvis
Venue: Second international workshop on Intelligent systems design and application (2002)

The digital networked world is enabling and requiring a new emphasis on personalized document creation. Traditional methods of producing document layout and style have become insufficient, since most are aimed at producing static results. Also, as new untrained users start producing documents for a wide audience, the old publishing tools prove too demanding. The new, more dynamic digital environment demands tools that can reproduce both the contents and the layout automatically, tailored to personal needs and transformed for the presentation device, and can enable novices to easily create such documents. In order to achieve such automated document assembly and transformation, we have formalized custom document creation as a constrained optimization problem, and use a genetic algorithm to assemble and transform compound personalized documents. We have found that using this approach provides advantages over existing custom document creation methods.
Understanding Acquisition Performance: The Role of Transfer Effects
Authors: Sydney Finkelstein, Jerayr Haleblian
Venue: Organization Science (2002)

Drawing on work from transfer theory at the individual unit of analysis, this study examines positive and negative transfer effects in organization acquisitions. Data from 96 organizations reveal that, consistent with theories on positive transfer of industry knowledge, similar acquisitions are positively related to acquisition performance. In addition, consistent with theory on negative transfer of past acquisition knowledge, second acquisitions underperform first acquisitions, particularly when first and second targets are from different industries. In combination, these findings suggest that the routines and practices established in prior situations transfer to new situations, and that the effect of such transfer depends on the similarity of industrial environments.
Encryption, decryption and programming
Authors: Terry A. Scott
Venue: Journal of Computing Sciences in Colleges (2001)

Several encryption algorithms are described. Some of these such as the credit card number algorithm are related to everyday life. These encryption methods make good programming assignments. In addition, methods of breaking the encrypted text are included with descriptions on how these can be used in the programming classroom. The author has found that students enjoy these assignments. In addition, the instructor can make it more fun by giving the student an encrypted message that can be decoded with their correctly working program. Of course encryption is very important in computer science so this gives students an introduction to this subject while doing the programming.
Mobile portals: the development of M-commerce gateways
Authors: Irvine Clarke,  III, Theresa B. Flaherty
Venue: Mobile commerce: technology, theory, and applications (2003)

The proliferation of mobile Internet devices is creating an unparalleled opportunity for mobile commerce. Factors composing a productive M-commerce portal development strategy are investigated to improve a company's strategy. Also explored are the nonpareil benefits of mobile applications to introduce a five-step approach for developing an effective mobile portal strategy.
A Statistical Admission Control Scheme for Continuous Media Servers Using Caching
Authors: Jin B. Kwon, Heon Y. Yeom
Venue: Multimedia Tools and Applications (2003)

In continuous media servers, disk load can be reduced by using buffer cache. In order to utilize the saved disk bandwidth by caching, a continuous media server must employ an admission control scheme to decide whether a new client can be admitted for service without violating the requirements of clients already being serviced. A scheme providing deterministic QoS guarantees in servers using caching has already been proposed. Since, however, deterministic admission control is based on the worst case assumption, it causes the wastage of the system resources. If we can exactly predict the future available disk bandwidth, both high disk utilization and hiccup-free service are achievable. However, as the caching effect is not analytically determined, it is difficult to predict the disk load without substantial computation overhead. In this paper, we propose a statistical admission control scheme for continuous media servers where caching is used to reduce disk load. This scheme improves disk utilization and allows more streams to be serviced while maintaining near-deterministic service. The scheme, called Shortsighted Prediction Admission Control (SPAC), combines exact prediction through on-line simulation and statistical estimation using a probabilistic model of future disk load in order to reduce computation overhead. It thereby exploits the variation in disk load induced by VBR-encoded objects and the decrease in client load by caching. Through trace-driven simulations, it is demonstrated that the scheme provides near-deterministic QoS and keeps disk utilization high.
On the convergence of fuzzy martingales
Authors: Yuhu Feng
Venue: Fuzzy Sets and Systems (2002)

The purpose of this paper is to prove the convergence theorem for fuzzy martingales without assuming that their values are Lipschitz or continuous fuzzy numbers on Rn. This approach allows us to deduce many results on convergence of fuzzy numbers and fuzzy random variables from the relevant results on real numbers and real-valued random variables that appear as their support functions. Based on the concept of fuzzy downward martingale and applications of convergence theorem of fuzzy martingales, the strong law of large numbers for fuzzy random variables is proved, here the convergence is in the uniform metric but not the separable metric on fuzzy number space.
NetSEC: metrology-based application for network security
Authors: Jean-François Scariot, Bernard Martinet
Venue: Future Generation Computer Systems (2003)

We know how to use metrology to discover functional problems on networks and how to measure error rate to detect active or passive abnormal behaviour items. We can even use it to observe the network use and to detect abnormal consumption of resources. This led us to develop a flow analyses application to secure networks. Built around a relational database system, filled by metrology platform and supporting multi-criteria sort queries, NetSEC allows analysis of unusual traffic in order to find its roots. A user-friendly web interface allows the use of the NetSEC application close to final users.
Stepping Towards Sustainable Business: An Evaluation of Waste Minimization Practices in US Manufacturing
Authors: Iain J. Clelland, Thomas J. Dean, Thomas J. Douglas
Venue: Interfaces (2000)

Central to the movement of organizations toward environmental sustainability is the financial viability and environmental effectiveness of the techniques for improving environmental performance. While waste-minimization practices (WMPs) have been touted as a key element in moving manufacturing organizations toward sustainability, we know little about their utilization and effectiveness across a range of industrial and organizational contexts. Using waste-minimization data collected as part of the Toxics Release Inventory, we studied 250 manufacturing firms to provide empirical evidence to enable plant managers to prioritize waste-minimization options. We found clear evidence of a corporate double bonus WMPs can provide through pollution reduction and enhanced operational efficiency relative to traditional end-of-pipe solutions. In the array of ecologically sustainable business practices, it appears that WMPs provide immediate environmental and operational benefits and build momentum for further steps toward environmentally sustainable economic development.
Subtle expressivity for characters and robots
Authors: Noriko Suzuki, Christoph Bartneck
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

People, both consciously and unconsciously, use subtle expressions to indirectly communicate their emotions and intentions through variations of the gaze direction, voice tone and gesture speed. People also perceive changes in the internal states of others from subtle changes in their expressivities while interacting with them. Subtle expressivity plays the supporting part to the leading role of explicit expressivity, such as contents of speech or category of facial expressions. However, subtle expressivity plays an important role to give moderate effects or gently regulate the relationship among the participants through a continuous interaction.These subtle expressivities are little focused on the design of interactive media in the context of software products and computers. Only in the area of computer games in which pre-designed animated characters are used, the full potential of subtle expressivity is fully understood and used.Although the general interest of the human-computer interaction research community in life-likeness and personality as a goal of software design is growing for reducing cognitive load [1,2], we are far from having coherent understanding of what subtle expressivity actually is and how products and processes can address it. We might question whether designing for subtle expressivity will result in gentle emotional effects on people and whether the processes and topics involved differ in any significant way from designing for believability or personality.
Selecting Scheduling Heuristics Using Neural Networks
Authors: Jatinder N. D. Gupta, Randall S. Sexton, Enar A. Tunc
Venue: INFORMS Journal on Computing (2000)

This paper discusses the application of neural networks to select the best heuristic algorithm to solve a given scheduling problem. The two-stage hybrid flowshop with multiple identical parallel machines at the second stage is used as an example to discuss the process of selecting a scheduling heuristic through a neural-network approach. This paper uses the genetic-algorithm-based approach for training the neural network and shows that the suggested neural-network approach is quite effective and efficient for selecting the best heuristic algorithm for solving a given scheduling problem.