ppxscal/embedding_network huggingface dataset:
Strategies for structuring two level memories in a paging environment
Authors: Albin L. Vareha, Ronald M. Rutledge, Michael M. Gold
Venue: Proceedings of the second symposium on Operating systems principles (1969)

The strategies for effective structuring of data and program code in a two level, directly addressable paged memory system are presented along with the experience gained from deriving and implementing appropriate algorithms in one time-shared system. The experience indicated that a reduction in the paging rate can result through the addition of a slower second-level bulk memory thus leading to improved performance. While improved techniques for structuring these memories coupled with faster and / or cheaper bulk memories offer further improvements in performance, reduction in the paging overhead might offset some of these performance advantages.
Distributed cooperative mining for information consortia
Authors: Satoshi Morinaga, Kenji Yamanishi, Jun-ichi Takeuchi
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

We consider the situation where a number of agents are distributed and each of them collects a data sequence generated according to an unknown probability distribution. Here each of the distributions is specified by common parameters and individual parameters e.g., a normal distribution with an identical mean and a different variance. Here we introduce a notion of an information consortium, which is a framework where the agents cannot show raw data to one another, but they like to enjoy significant information gain for estimating the respective distributions. Such an information consortium has recently received much interest in a broad range of areas including financial risk management, ubiquitous network mining, etc. In this paper we are concerned with the following three issues: 1) how to design a collaborative strategy for agents to estimate the respective distributions in the information consortium, 2) characterizing when each agent has a benefit in terms of information gain for estimating its distribution or information loss for predicting future data, and 3) charracterizing how much benefit each agent obtains. In this paper we yield a statistical formulation of information consortia and solve all of the above three problems for a general form of probability distributions. Specifically we propose a basic strategy for cooperative estimation and derive a necessary and sufficient condition for each agent to have a significant benefit.
Anonymity and Security in Continuous Double Auctions for Internet Retails Market
Authors: Changjie Wang, Ho-fung Leung
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Electronic auctions have become an integral part of Electronic Commerce nowadays. Besides the popular single-sided auction protocols, i.e. English auction, Vickrey auction etc., Continuous Double Auction (CDA) is an important auction protocol that permits multiple buyersand sellers to trade goods. Internet CDAs have been widely used in financial and commodities markets. Although Internet provides an excellent infra-structure for CDAs, anonymity and security are important issues in the electronic CDA marketplaces. While most studies have been focusing on the strategies in agent-oriented CDAs [2] [3] [4] [5], relatively little research has been done on the privacy and security issues. In this paper, we first discuss the privacy and security issues in electronic CDAs, and propose that the security requirements in electronic CDAs include anonymity, traceability, impossibility of impersonation, unforgeablility, and verifiability. We then describe an anonymous and secure CDA protocol for electronic marketplaces. In the new protocol, both the anonymity of traders and the traceability of false offers are achieved. The identities of normal traders and their bidding behaviors are protected, while the identities of malicious traders can be revealed. With a simple analysis, we show that our CDA scheme satisfies all the required security properties.
Hume: a domain-specific language for real-time embedded systems
Authors: Kevin Hammond, Greg Michaelson
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

This paper describes Hume: a novel domain-specific language whose purpose is to explore the expressibility/costability spectrum in resource-constrained systems, such as real-time embedded or control systems. Hume provides a number of high level features including higher-order functions, polymorphic types, arbitrary but sized user-defined data structures, asynchronous processes, lightweight exception handling, automatic memory management and domain-specific metaprogramming features, whilst seeking to guarantee strong space/time behaviour and maintaining overall determinacy.
Constructivist physics learning in an immersive, multi-user hot air balloon simulation program (iHABS)
Authors: Wong Lai Kuan, Chee Yam San
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

This paper describes and discusses an immersive multi-user Hot Air Balloon Simulation (iHABS) project that allows students to experience virtual hot air ballooning. The iHABS project enables students to pilot a hot air balloon as well as learn fundamental physics principles in a fun, exciting, engaging, and collaborative setting.We briefly survey the use of hot air ballooning in physics teaching and the use of VR technologies in support of learning. We then discuss the pedagogical support provided by iHABS. Next, we proceed with a detailed description of the iHABS system followed by a discussion on the design of interaction techniques, the system design and its implementation.
A Cognitive Vision Platform for Automatic Recognition of Natural Complex Objects
Authors: Céline Hudelot, Monique Thonnat
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

This paper presents a generic cognitive vision platform for the automatic recognition of natural complex objects. The recognition consists of three steps : image processing for numerical object description, mapping of numerical data into symbolic data and semantic interpretation for object recognition. The focus of this paper is the distributed platform architecture composed of three highly specialized Knowledge Based Systems (KBS). The first KBS is dedicated to semantic interpretation. The second one has to deal with the anchoring of symbolic data into image data. The last KBS is dedicated to intelligent image processing. Aftera brief overview of the natural object recognition problem, this paper describes the three subcomponents of the platform.
Stress Resistant Scheduling Algorithms for CIOQ Switches
Authors: Prashanth Pappu, Jonathan Turner
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Practical crossbar scheduling algorithms for CIOQ switches such as PIM and i-SLIP, can perform poorly under extreme traffic conditions, frequently failing to be work-conserving. The common practice of evaluating crossbar scheduling algorithms according to the packet delay under random admissible traf.c tends to obscure significant differences that affect the robustness of different algorithms when exposed to extreme conditions. On the other hand,algorithms such as LOOFA with provably good worst-case performance, don't lend themselves readily to high performance implementation. We advocate evaluating crossbar scheduling algorithms using targeted stress tests which seek to probe the performance boundaries of competing alternatives. Appropriately designed stress tests can reveal key differences among algorithms and can provide the insight needed to spur the development of better solutions.In this paper, we introduce the use of stress testing for crossbar scheduling and use it to evaluate the performance of PIM, i-SLIP and LOOFA. Our results show that PIM and i-SLIP need large speedups in order to perform well on stress tests, while LOOFA can deliver excellent performance, even for speedups less than 1.5. We then develop improved versions of PIM and i-SLIP, which take output queue lengths into account, making them much more robust. We also develop an algorithm which closely approximates the behavior (and performance) of LOOFA, but which admits a straightforward, high performance hardware implementation.
Essistants
Authors: Christos Tryfonas, James Schumacher
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

One of the challenges the service providers currently face is the ability to introduce a variety of services at a minimal cost and impact to their customers. These services often become personalized as more and more content becomes available. The natural progression to the service/content explosion is a seamless user interface that remains consistent across the various services and devices. The Essistant architecture attempts to provide personalized services to the end users through a seamless multi-modal user interface and a systematization of the backend services. This paper describes the overall architecture of the Essistant project. The associated video demonstrates the functionality of Essistant for a set of services that have been implemented in a lab environment. The services include video-on-demand using an automated price broker, broadcast video over IP multicast, personalized news, and horoscope, and interaction with the physical space by acting as a proxy to a robot.
First-Order and Second-Order Conditions for Error Bounds
Authors: Zili Wu, Jane J. Ye
Venue: SIAM Journal on Optimization (2003)

For a lower semicontinuous function f on a Banach space X, we study the existence of a positive scalar $\mu$ such that the distance function dS associated with the solution set S of $f(x)\leq 0$ satisfies \[ d_S(x)\leq \mu \max\{ f(x),0\} \] for each point x in a neighborhood of some point x0 in X with $f(x)<\epsilon$ for some $0<\epsilon \leq +\infty.$ We give several sufficient conditions for this in terms of an abstract subdifferential and the Dini derivatives of f. In a Hilbert space we further present some second-order conditions. We also establish the corresponding results for a system of inequalities, equalities, and an abstract constraint set.
Identifying adaptation dimensions in digital talking books
Authors: Carlos Duarte, Luís Carriço
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper we identify adaptation enabling variables, and components that can be adapted, in a setting specific to Digital Talking Books. We then propose an evolution to our Digital Talking Book builder framework, to enable the production of adaptive books.
Nondeterministic Communication with a Limited Number of Advice Bits
Authors: Juraj Hromkovic, Georg Schnitger
Venue: SIAM Journal on Computing (2004)

We present a new technique for differentiating deterministic from nondeterministic communication complexity. As a consequence we give almost tight lower bounds for the nondeterministic communication complexity with a restricted number of advice bits. In particular, for any function $t : \mathbb{N} \rightarrow \mathbb{N}$ with $t(n) \leq n/2$ we construct a family $(L_{n,t(n)} : n \in \mathbb{N})$ of languages such that $L_{n,t(n)} \subseteq \{0,1\}^{2n}$, ${\rm nc}(L_{n,t(n)}) = O(t(n) \cdot \log_2 \frac{n}{t(n)})$ and ${\rm nc}(\overline{L_{n,t(n)}}) = O\bigl(\frac{n}{t(n) \cdot \log_2 \frac{n}{t(n)}} + \log_2 t(n)\bigr)$, but ${\rm nc}_{o(t(n))}(L_{n,t(n)}) = \Omega\bigl(\frac{n}{\log_2 \frac{n}{t(n)}}\bigr)$. Here ${\rm nc}_r(L)$ is the nondeterministic communication complexity of L, assuming that at most r advice bits are utilized. Thus, in contrast to probabilistic communication complexity, a small reduction in the number of advice bits results in almost maximal communication. As a special case we obtain a family $L_n \subseteq \{0,1\}^{2n}$ of languages with {\rm nc}_{o(\sqrt{n}/\log_2 n)}(L_n) &=& \Omega\biggl(\frac{n}{\log_2 n}\biggr),\\ {\rm nc}(L_n) + {\rm nc}(\overline{L_n}) &=& O(\sqrt{n}), and hence nondeterministic communication with slightly restricted access to advice bits is almost quadratically weaker than nondeterminism that always gives correct answers (from the set {yes, no, ?}). As a consequence we obtain an almost optimal separation between Monte-Carlo communication and "correct" nondeterminism and answer a question of Beame and Lawry.
Comprehensive statistical admission control for streaming media servers
Authors: Roger Zimmermann, Kun Fu
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Streaming media servers and digital continuous media recorders require the scheduling of I/O requests to disk drives in real time. There are two accepted paradigms to achieve this: deterministic or statistical. The deterministic approach must assume larger bounds on such disk parameters as the seek time, the rotational latency and the transfer rate, to guarantee the timely service of I/O requests. The statistical approach generally allows higher utilization of resources, in exchange for a residual probability of missed I/O request deadlines. We propose a novel statistical admission control algorithm called TRAC based on a comprehensive three random variable (3RV) model to support both reading and writing of multiple variable bit rate media streams on current generation disk drives. Its major distinctions from previous work include (1) a very realistic disk model which considers multi-zoning of disks, seek and rotational latency profiles, and unequal reading and writing data rate limits, (2) a dynamic bandwidth sharing mechanism between reading and writing, and (3) support for random placement of data blocks. We evaluate the TRAC algorithm through an extensive numerical analysis and real device measurements. The results show that it achieves a much more realistic resource utilization (up to 38\% higher) as compared with the best, previously proposed algorithm based on a single random variable (1RV) model. Most impressive, in all the experiments the difference between the results generated by TRAC and the actual disk device measurements match closely.
Test-Driven Development as a Defect-Reduction Practice
Authors: Laurie Williams, E. Michael Maximilien, Mladen Vouk
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Test-driven development is a software developmentpractice that has been used sporadically for decades.With this practice, test cases (preferably automated) areincrementally written before production code isimplemented. Test-driven development has recently re-emergedas a critical enabling practice of the ExtremeProgramming software development methodology. Weran a case study of this practice at IBM. In the process, athorough suite of automated test cases was produced afterUML design. In this case study, we found that the codedeveloped using a test-driven development practiceshowed, during functional verification and regressiontests, approximately 40% fewer defects than a baselineprior product developed in a more traditional fashion.The productivity of the team was not impacted by theadditional focus on producing automated test cases. Thistest suite will aid in future enhancements andmaintenance of this code. The case study and the resultsare discussed in detail.
When executives code
Authors: Phillip Armour
Venue: Communications of the ACM (2004)

Corporate executives are realizing that not only is managing software important, it is the essence of what they do.
Imprecise previsions for risk measurement
Authors: Renato Pelessoni, Paolo Vicig
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

In this paper the theory of coherent imprecise previsions is applied to risk measurement. We introduce the notion of coherent risk measure defined on an arbitrary set of risks, showing that it can be considered a special case of coherent upper prevision. We also prove that our definition generalizes the notion of coherence for risk measures defined on a linear space of random numbers, given in literature. Consistency properties of Value-at-Risk (VaR), currently one of the most used risk measures, are investigated too, showing that it does not necessarily satisfy a weaker notion of consistency called 'avoiding sure loss'. We introduce sufficient conditions for VaR to avoid sure loss and to be coherent. Finally we discuss ways of modifying incoherent risk measures into coherent ones.
Pontrjagin duality and full completeness for multiplicative linear logic (without Mix)
Authors: Masahiro Hamano
Venue: Mathematical Structures in Computer Science (2000)

We prove a full completeness theorem for MLL without the Mix rule. This is done by interpreting a proof as a dinatural transformation in a &ast;-autonomous category of reflexive topological abelian groups first studied by Barr, denoted &Rscr;&Tscr;&Ascr;. In Section 2, we prove the unique interpretation theorem for a binary provable MLL-sequent. In Section 3, we prove a completeness theorem for binary sequents in MLL without the Mix rule, where we interpret formulas in the category &Rscr;&Tscr;&Ascr;. The theorem is proved by investigating the concrete structure of &Rscr;&Tscr;&Ascr;, especially that arising from Pontrjagin's work on duality.
Variations on realizability: realizing the propositional axiom of choice
Authors: J. M. E. Hyland
Venue: Mathematical Structures in Computer Science (2002)

Realizability and related functional interpretations provide models for constructive mathematics. Generally, these models do not validate the axiom of choice for propositions taken over hierarchies of extensional functionals. We describe simple classes of models where the axiom is validated.
Combining heterogeneous temporal information: A case study
Authors: Silvana Badaloni
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

In this paper we present a specialized system for temporal reasoning representing possibly uncertain qualitative and quantitative constraints relative to temporal intervals in a homogeneous framework. The underlying logic is that of Allen, which we have extended to include quantitative temporal information. Intervals are still assumed as primitive entities while, to represent metric information, time points are introduced only at the algorithmic level. We illustrate the properties of the temporal representation, the algorithms used for constraint propagation, and their complexity. We show how the system can be used to schedule manufacturing operations in a small factory.
Supporting an experiment of a community support system: community analysis and maintenance functions in the public opinion channel
Authors: Tomohiro Fukuhara, Masaki Chikama, Toyoaki Nishida
Venue: Communities and Technologies (2003)

Community analysis and maintenance functions of a community support system called Public Opinion Channel (POC) are described. A field-test and a psychological experiment using a community support system are important for investigating activities in a community. Existing community support systems, however, have limitations on having an experiment smoothly because few systems consider functions for supporting an experiment. To investigate activities in a community smoothly, community support systems should have community analysis and maintenance functions that support an analyst and a community organizer in an experiment. We implemented those functions in the POC system, and used in a field-test and a social psychological experiment. From these experiments, we found that proposed functions enabled an analyst and a community organizer to (1) find up-to-date state of a community during an experiment, (2) analyze relations between messages efficiently and objectively, and (3) maintain communities easily. Requirements for the functions, implementation, and experience in the experiments are described.
Technology and knowledge management: is technology just an enabler or does it also add value?
Authors: Helen J. Mitchell
Venue: Knowledge management: current issues and challenges (2003)

Technology, having made rapid and extensive advances particularly in the area of communications, has opened opportunities for the gathering of information and providing a means through which knowledge can be shared. Organisations are recognising that information and knowledge will have an important bearing on where they are going in the future. While technologies are a means to link functional areas providing effective conduit for information and the sharing of knowledge, people within the organisation must be well trained in the use and understanding of technology for maximum benefit to be gained. Referred to frequently as just being an enabler, technology does add value. Without technology, organisations would find it very difficult to access the vast amount of information that is available in the external environment. They would not be able to link people both internally and externally for the sharing of knowledge and it is through sharing of ideas that new innovations emerge. While technology can be identified as an enabler it also adds considerable value to the management and operation of organisations.
An analysis and approach to using existing ontological systems for applications in manufacturing
Authors: Craig Schlenoff, Peter Denno, Rob Ivester, Don Libes, Simon Szykman
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This paper reports on the results of an analysis of existing ontological systems to determine which is most appropriate for the manufacturing domain. In particular, this involved the exploration of efforts that are studying both the uses of ontologies in the general sense and those that are using ontologies for domain-specific purposes. Eleven ontological systems were analyzed and, using a set of analysis criteria, it was determined that the Cyc (Cyc is a registered trademark of Cycorp Inc.) system was most appropriate for modeling concepts in the manufacturing domain. After the analysis is described, examples are given to show how manufacturing concepts could be modeled in the Cyc system. This work is part of a larger project whose objective is to move closer to the ultimate goal of seamless manufacturing systems integration using the principle behind ontological engineering to unambiguously define domain-specific concepts. The output of this work will be a taxonomy of manufacturing terms and concepts along with formal definitions of exactly what each of those terms and concepts mean and how they interrelate.
The transmutation of the architectural synthesis. Morphing procedures through the adaptation of informational technology
Authors: Marianthi Liapi, Konstantinos-Alketas Ougrinis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The notion of informational mobility that came along with the revolutionary development of digital media reconfigured radically the architectural practice. There are two main axes on which this transmutation has been observed. The one is constituted by the modifications in the procedure of the architectural production that leaded to more complete but standardized mass projects, in relation with advanced methods of construction. The other refers to the theoretical approach of architecture for a digitally altered world. The virtual augmentation of biologic perception revealed an amplified (broader) experiential universe, urging the manipulators of space to evolve. The integration of digital systems facilitates a spherical approach, including a plethora of parameters. The transcended outcome is a mutation to an architectural hybrid composed of mass and information.