ppxscal/embedding_network huggingface dataset:
Categorization of Japanese TV Viewers Based on Program Genres They Watch
Authors: Yumiko Hara, Yumiko Tomomune, Maki Shigemori
Venue: User Modeling and User-Adapted Interaction (2004)

Although programpreferences can be characterized on the basis of demographic attributes like sex, age or occupation or by taking the cultural studies approach focused on ethnic or social traits, preferences for programs often differ among people of the same sex, age, occupation and social class. We think that nothing can describe subjects' viewing preferences more accurately than what programs they had watched in the past. To verify our hypothesis, we surveyed the viewing behavior of more than 1,600 randomly chosen individuals, and utilized this data to analyze people's program choices. We categorized the respondents by the similarity of the programs they had watched and examined the groupings that emerged and the features of these groups.From our analysis, it became clear that a `more/less serious' and `more/less fictional' axes are involved in program selection.Our results show that eight groups (stereotypes) explain viewers' contact with television, their motivation for choosing programs to watch, and their interest in matters other than television. Applying these stereotypes to the process of program selection or recommendation will be useful for the future design of personalized adaptive systems.
Computer vision for human modelling and analysis
Authors: Adrian Hilton
Venue: Machine Vision and Applications (2003)

This report summarises the author's views and experience on the application of computer vision technology for the modelling and analysis of people. The author conducted research which led to the first commercial booth system for capturing animated models of people for applications in games, multimedia and virtual reality. This research is ongoing with the aim of developing studio capture technology to enable photo-realistic capture of a person's shape, appearance and movement for broadcast production.
Unifying access to heterogeneous document databases through contextual metadata
Authors: Virpi Lyytikäinen, Pasi Tiitinen, Airi Salminen
Venue: Effective databases for text & document management (2003)

Document databases available on the Internet carry massive information resources. To a person needing a piece of information on a specific domain, finding the piece, however, is often quite problematic even though there were a representative collection of databases available on the domain. The languages used in the content, the names of document types, their structures, the ways documents are organized and their retrieval techniques often vary in the databases. The databases containing legal information on the Internet offer a typical example. For finding relevant documents and for being able to interpret the content of the documents correctly, the user may need information about the context where the documents have been created. In this chapter we introduce a method for collecting contextual metadata and for representing the metadata to the users by graphical models. The solution is demonstrated by a case of retrieving information from distributed European legal databases.
An overview of DNS-based server selections in content distribution networks
Authors: Jianping Pan, Y. Thomas Hou, Bo Li
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

With the explosive growth of the Internet, many new online services and applications are emerging. Some popular applications impose new challenges to the traditional Internet architecture and protocols. To alleviate the scalability burden in delivering popular Internet services to a large number of users, Web caching and content distribution technologies have been proposed, developed and deployed. Both approaches are designed to bring Web content closer to users and to improve their perceived quality of online experience. This paper surveys content distribution networks (CDNs), and in particular, their domain name system (DNS)-based server selection schemes. To bridge the gap between underlying principles and current practices, we choose a commercial content delivery provider, Akamai, as our focal case study. We first unveil Akamai's content delivery network, as well as its site and object delivery technologies. We then examine the DNS-based server selection schemes and their variants in detail. Moreover, we offer some performance insights and discussions on their built-in strengths and weaknesses that are also applicable to other CDN providers.
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
Authors: Budhaditya Deb, Sudeept Bhatnagar, Badri Nath
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Sensor networks are meant for sensing and disseminatinginformation about the environment they sense. The criticalityof a sensed phenomenon determines its importance tothe end user. Hence, data dissemination in a sensor networkshould be information aware. Such information awarenessis essential firstly to disseminate critical information morereliably and secondly to consume network resources proportionalto the criticality of information. In this paper, wedescribe a protocol called ReInForM to deliver packets atdesired reliability at a proportionate communication cost.ReInForm sends multiple copies of each packet along multiplepaths from source to sink, such that data is delivered atthe desired reliability. It uses the concept of dynamic packetstate in context of sensor networks, to control the numberof paths required for the desired reliability, and does so usingonly local knowledge of channel error rates and topology.We show that for uniform unit disk graphs, the numberof edge-disjoint paths between nodes is equal to the averagenode degree with very high probability. ReInForm utilizesthis property in its randomized forwarding mechanismwhich results in use of all possible paths and efficient loadbalancing.
A generative model for separating illumination and reflectance from images
Authors: Inna Stainvas, David Lowe
Venue: The Journal of Machine Learning Research (2003)

It is well known that even slight changes in nonuniform illumination lead to a large image variability and are crucial for many visual tasks. This paper presents a new ICA related probabilistic model where the number of sources exceeds the number of sensors to perform an image segmentation and illumination removal, simultaneously. We model illumination and reflectance in log space by a generalized autoregressive process and Hidden Gaussian Markov random field, respectively.The model ability to deal with segmentation of illuminated images is compared with a Canny edge detector and homomorphic filtering. We apply the model to two problems: synthetic image segmentation and sea surface pollution detection from intensity images.
CODA: congestion detection and avoidance in sensor networks
Authors: Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbell
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is likely to lead to varying degrees of congestion in the network depending on the sensing application. It is during these periods of event impulses that the likelihood of congestion is greatest and the information in transit of most importance to users. To address this challenge we propose an energy efficient congestion control scheme for sensor networks called CODA (COngestion Detection and Avoidance) that comprises three mechanisms: (i) receiver-based congestion detection; (ii) open-loop hop-by-hop backpressure; and (iii) closed-loop multi-source regulation. We present the detailed design, implementation, and evaluation of CODA using simulation and experimentation. We define two important performance metrics (i.e., energy tax and fidelity penalty) to evaluate the impact of CODA on the performance of sensing applications. We discuss the performance benefits and practical engineering challenges of implementing CODA in an experimental sensor network testbed based on Berkeley motes using CSMA. Simulation results indicate that CODA significantly improves the performance of data dissemination applications such as directed diffusion by mitigating hotspots, and reducing the energy tax with low fidelity penalty on sensing applications. We also demonstrate that CODA is capable of responding to a number of congestion scenarios that we believe will be prevalent as the deployment of these networks accelerates.
Using the web for enhancing decision-making: UN project failures in sub-Sahara Africa (SSA)
Authors: David King
Venue: Managing IT in government business & communities (2003)

The purpose of this chapter is to highlight the use of the Internet to improve the reliability of information supplied to the United Nations (UN) from official sources in Sub-Sahara Africa (SSA). The focus of the chapter is that aid project failures in SSA need efficient project management, effective communication, and information openness to achieve socio-economic growth. The use of the Internet's potential(s) in a way that will benefit society at large and in particular vulnerable groups needs critical examination within a wider framework of the actual needs and existing facilities of these communities. An interpretive evidence data collection method is used through questioning and interviews with stakeholder groups, validated by observation where possible. The importance of aid project performance, assessment, and monitoring in SSA is emphasised. The significance of public participation in decision-making processes is explored. This research also highlights the pragmatics of giving local people an international voice.
Cost-Efficient Block Verification for a UMTS Up-Link Chip-Rate Coprocessor
Authors: Klaus Winkelmann, Hans-Joachim Trylus, Dominik Stoffel, Görschwin Fey
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

ASIC designs for future communication applications cannot be simulated exhaustively. Formal Property Checking is a powerful technology to overcome the limitations of current functional verification approaches. The paper reports on a large-scale experiment employingthe CVE property checker for verifying the block-level functional correctness of a large ASIC.This new verification methodology achieves substantial quality and productivity gains. The two biggest advantages are:Coding and Verification can be done in parallel.The whole state space of a test case will be verifiedin a single run.Formal Property Checking simplifies and shortens the functional verification of large-scale ASICs at least in the same order of magnitude as Static Timing Analysis did for timing verification.
Towards differentiation-enabled Fortran 95 compiler technology
Authors: Malcolm Cohen, Uwe Naumann, Jan Riehme
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We present a novel approach to generating derivative code for mathematical models implemented as Fortran 95 programs using Automatic Differentiation inside a compiler. This technique allows us to combine the advantages of both operator overloading and source transformation based tools for Automatic Differentiation. Furthermore, the compiler's infrastructure for syntactic, semantic, and static data flow analysis can be built on.
A Set Theoretic Approach to Dynamic Robot Localization and Mapping
Authors: M. Di Marco, A. Garulli, A. Giannitrapani, A. Vicino
Venue: Autonomous Robots (2004)

This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theoretic approach to the problem is presented. Computationally efficient algorithms for measurement-to-feature matching, estimation of landmark positions, estimation of robot location and heading are derived, in terms of uncertainty regions, under the hypothesis that errors affecting all sensors measurements are unknown-but-bounded. The proposed technique is validated in both simulation and experimental setups.
Web HorizoN: The Design of a 3D GIS Web Solution
Authors: Pedro Branco
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

HorizoN is a fully integrated Geographical Information solution that is able to re-use data from past and present independent systems, and fuse them in a single and highly adaptable product capable of various utilizations in civil protection, planning, monitoring and marketing projects. The development of such a system was focused in creating new software architecture to allow an unprecedented Environmental Data Interoperability and Interchange capability.
The Choice Number of Dense Random Graphs
Authors: Michael Krivelevich
Venue: Combinatorics, Probability and Computing (2000)

We prove that if the edge probability p(n) satisfies n&minus;1&#x002F;4+ε &le; p(n) &le; 3&#x002F;4, where 0 < ε < 1&#x002F;4 is a constant, then the choice number and the chromatic number of the random graph G(n, p) are almost surely asymptotically equal.
An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks
Authors: Jian Yang, Yiping Zhong, Shiyong Zhang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Efficient search mechanism is a very important aspect of any peer-to-peer system. Current search mechanisms in both DHT-based structured peer-to-peer networks and unstructured peer-to-peer networks are either lack of flexibility or very inefficient. In this paper, we proposean efficient search mechanism based on interest-group, which is formed by nodes sharing similar interests. Metadata are used to describe and represent documents that nodes share with others. We deploy Metadata Slide Window and metadata replication to facilitate the search process. Preliminary analysis and simulation results prove the effectiveness and efficiency of the proposed search mechanism.
A Cost-Benefit Stopping Criterion for Statistical Testing
Authors: S. J. Prowell
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Determining when to stop a statistical test is an important management decision. Several stopping criteria have been proposed, including criteria based on statistical similarity, the probability that the system has a desired reliability, and the expected cost of remaining faults. This paper proposes a new stopping criterion based on a cost-benefit analysis using the expected reliability of the system (as opposed to an estimate of the remaining faults). The expected reliability is used, along with other factors such as units deployed and expected use, to anticipate the number of failures in the field and the resulting anticipated cost of failures.Reductions in this number generated by increasing the reliability are balanced against the cost of further testing to determine when testing should be stopped.
Constructions using balanced n-ary designs
Authors: Malcolm Greig
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

We describe how a BIBD construction problem was solved using a Balanced Ternary Design. We explore how this construction can be improved, and how and what balanced n-ary designs can be used in this construction. We settle several open existence cases for BTDs (including both suitable and unsuitable designs for our construction), and provide a number of suitable BnDs.
Real-time simulation of electric drives
Authors: R. Champagne, L.-A. Dessaint, H. Fortin-Blanchette
Venue: Mathematics and Computers in Simulation (2003)

This paper presents a real-time simulation of an ac electric drive. The main purpose of this type of simulation is to provide an efficient, cost-effective and secure way of testing the control part of an electric drive. Therefore, the electric motor and the electronic converter of the drive are simulated using a time-step of about 50 µs and an external controller is tested by interfacing it to the real-time simulation. Note that the distribution system and the motor mechanical load can be also conveniently included in the real-time simulation. This new way of testing drive's controllers avoids the need for bulky and expensive test benches equipped with high power motors, converters and measurement devices. The real-time simulation results are validated by comparing them to their off-line version.
Summarizing procedures in concurrent programs
Authors: Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used routinely in a variety of compiler optimizations and software defect-detection tools. However, the benefit of summarization is not available to multithreaded programs, for which a clear notion of summaries has so far remained unarticulated in the research literature.In this paper, we present an intuitive and novel notion of procedure summaries for multithreaded programs. We also present a model checking algorithm for these programs that uses procedure summarization as an essential component. Our algorithm can also be viewed as a precise interprocedural dataflow analysis for multithreaded programs. Our method for procedure summarization is based on the insight that in well-synchronized programs, any computation of a thread can be viewed as a sequence of transactions, each of which appears to execute atomically to other threads. We summarize within each transaction; the summary of a procedure comprises the summaries of all transactions within the procedure. We leverage the theory of reduction [17] to infer boundaries of these transactions.The procedure summaries computed by our algorithm allow reuse of analysis results across different call sites in a multithreaded program, a benefit that has hitherto been available only to sequential programs. Although our algorithm is not guaranteed to terminate on multithreaded programs that use recursion (reachability analysis for multithreaded programs with recursive procedures is undecidable [18]), there is a large class of programs for which our algorithm does terminate. We give a formal characterization of this class, which includes programs that use shared variables, synchronization, and recursion.
Comparative evaluation of support vector machines and probabilistic neural networks in superficial bladder cancer classification
Authors: P. Spyridonos, P. Petalas, D. Glotsos, G. Nikiforidis, D. Cavouras, P. Ravazoula
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this study a comparative evaluation of Support Vector Machines (SVMs) and Probabilistic neural networks (PNNs) was performed exploring their ability to classify superficial bladder carcinomas as low or high-risk. Both classification models resulted in a relatively high overall accuracy of 85.3% and 83.7% respectively. Descriptors of nuclear size and chromatin cluster patterns were participated in both best feature vectors that optimized classification performance of the two classifiers. Concluding, the good performance and consistency of the SVM and PNN models enforces the belief that certain nuclear features carry significant diagnostic information and renders these techniques viable alternatives in the diagnostic process of assigning urinary bladder carcinomas grade.
On Restricted Sums
Authors: Y. O. Hamidoune, A. S. Lladó, O. Serra
Venue: Combinatorics, Probability and Computing (2000)

Let G be an abelian group. For a subset A &sub; G, denote by 2 &and; A the set of sums of two different elements of A. A conjecture by Erd&ouml;s and Heilbronn, first proved by Dias da Silva and Hamidoune, states that, when G has prime order, &#x2223;2 &and; A&#x2223; &ge; min(&#x2223;G&#x2223;, 2&#x2223;A&#x2223; &minus; 3).We prove that, for abelian groups of odd order (respectively, cyclic groups), the inequality &#x2223;2 &and; A&#x2223; &ge; min(&#x2223;G&#x2223;, 3&#x2223;A&#x2223;&#x002F;2) holds when A is a generating set of G, 0 &isin; A and &#x2223;A&#x2223; &ge; 21 (respectively, &#x2223;A&#x2223; &ge; 33). The structure of the sets for which equality holds is also determined.
Defect tolerance for nanocomputer architecture
Authors: Arvind Kumar, Sandip Tiwari
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Defect tolerant architectures will be mandatory for building economical and cheap computing systems with billions of devices of nanometer dimension because it will contain significant number of defects due to statistical variations. The basic idea behind a defect tolerant custom configurable system is to build the system out of partially perfect components, detect the defects and configure the available good resources using software. In this paper we discuss implications of defect tolerance on power, area, delay and other relevant parameters for computing architectures. The additional requirement of a scalable configuration mechanism, redundant components and detection scheme necessitates extra burden on the interconnect to sustain it. Through back-of-envelope calculations using a priori wire length estimation and intuitive arguments we will illustrate the hidden cost of supporting such an architecture.
The space cost of lazy reference counting
Authors: Hans-J. Boehm
Venue: ACM SIGPLAN Notices (2004)

Reference counting memory management is often advocated as a technique for reducing or avoiding the pauses associated with tracing garbage collection. We present some measurements to remind the reader that classic reference count implementations may in fact exhibit longer pauses than tracing collectors.We then analyze reference counting with lazy deletion, the standard technique for avoiding long pauses by deferring deletions and associated reference count decrements, usually to allocation time. Our principal result is that if each reference count operation is constrained to take constant time, then the overall space requirements can be increased by a factor of Ω(R) in the worst case, where R is the ratio between the size of the largest and smallest allocated object. This bound is achievable, but probably large enough to render this design point useless for most real-time applications.We show that this space cost can largely be avoided if allocating an $n$ byte object is allowed to additionally perform O(n) reference counting work.
Project management and management of design: Teaching and tools
Authors: Patrick Little
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

While there are many project management tools and software packages available, these are not widely used in the design curriculum at colleges and universities. This may reflect some of the differences between conventional projects and design activities. In particular, the open-ended nature of design activities and the need to clarify the client's intention may lead to the conclusion that conventional project management tools are only useful for the most routine activities in the design process. It is suggested that there is a market for a new set of tools for teaching the management of design. These tools should incorporate the most useful of the current management tools and integrate them with some of the requirements of effective design, including support for clarification of objectives, functional analysis, and generation and evaluation of alternatives.