ppxscal/embedding_network huggingface dataset:
One More Take on Identity
Authors: Jim Miller
Venue: IEEE Internet Computing (2009)

The author discusses the methods we use to identify ourselves on the Internet and illuminates what's wrong with the current approach. He suggests and examines an alternative for where the notion of identification might go in the future.
Fundamentals of fuzzy preference modeling
Authors: Imre J. Rudas, János Fodor
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper we give a survey of some classical as well as most recent models of preferences based on pairwise comparison of alternatives. The underlying framework is fuzzy logic in which preferences can be expressed in a gradual way. Fuzzy preference structures, as a generalization of Boolean (2-valued) preference structures, are studied. A fuzzy preference structure is a triplet of fuzzy relations expressing strict preference, indifference and incomparability in terms of truth degrees. An important issue is the decomposition of a fuzzy preference relation into such a structure. An appropriate approach requires some effort and axiomatic consideration, because the straightforward formalism of the Boolean case gives undesirable results. We point out the essential role of the logical connectives behind fuzzy preferences through their axiomatic constructions and characterizations.
Interaction monitors in a distributed system
Authors: Rajiv Malhotra
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

By utilizing the parallelism and redundancy inherent in a network, a set of interacting processes could be made more effective. But this should not require the user to know the network details: the network should be transparent enough to allow him to treat it as a single entity rather than as a collection of computers. The concept of relocatable programs within a machine could be generalized to allow processes to be relocatable anywhere within the network. Then, several mappings could exist from a given set of processes to the set of computers in the network, with the final results being independent of the mapping used.
Exploring how to use scenarios to discover requirements
Authors: Norbert Seyff, Neil Maiden, Kristine Karlsen, James Lockerbie, Paul Gr&#x00fc;nbacher, Florian Graf, Cornelius Ncube
Venue: Requirements Engineering (2009)

This paper investigates the effectiveness of different uses of scenarios on requirements discovery using results from requirements processes in two projects. The first specified requirements on a new aircraft management system at a regional UK airport to reduce its environmental impact. The second specified new work-based learning tools to be adopted by a consortium of organizations. In both projects scenarios were walked through both in facilitated workshops and in the stakeholders&#x2019; workplaces using different forms of a scenario tool. In the second project, scenarios were also walked through with a software prototype and creativity prompts. Results revealed both qualitative and quantitative differences in discovered requirements that have potential implications for models of scenario-based requirements discovery and the design of scenario tools.
Verifying Social Expectations by Model Checking Truncated Paths
Authors: Stephen Cranefield, Michael Winikoff
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectations, together with infrastructure supporting conformance checking. This paper presents a logical account of the fulfilment and violation of social expectations modelled as conditional rules over a hybrid linear propositional temporal logic. Our semantics captures the intuition that the fulfilment or violation of an expectation must be determined without recourse to information from later states. We define a means of updating expectations from one state to the next based on formula progression, and show how conformance checking was implemented by extending the MCLITE and MCFULL algorithms of the Hybrid Logics Model Checker.
UniPhier: series development and SoC management
Authors: Yoshito Nishimichi, Nobuo Higaki, Masataka Osaka, Seiji Horii, Hisato Yoshida
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A digital CE integrated platform "UniPhier" (Universal Platform for High-quality Image Enhancing Revolution) has been developed to accelerate sharing technology and design assets across product categories from mobile phones to home-use AV. On the integrated platform, it's easy to use software and hardware assets that allows reusing across product categories, and great enhance of digital CE products has been realized. In this paper, an overview of the integrated platform "UniPhier" and it's SoC (System on a Chip) application examples are described.
A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
Authors: Chengji Liang, Youfang Huang, Yang Yang
Venue: Computers and Industrial Engineering (2009)

A considerable growth in worldwide container transportation needs essential optimization of terminal operations. An operation schedule for berth and quay cranes can significantly affect turnaround time of ships, which is an important objective of all schedules in a port. This paper addresses the problem of determining the berthing position and time of each ship as well as the number of quay cranes assigned to each ship. The objective of the problem is to minimize the sum of the handling time, waiting time and the delay time for every ship. We introduce a formulation for the simultaneous berth and quay crane scheduling problem. Next, we combine genetic algorithm with heuristic to find an approximate solution for the problem. Computational experiments show that the proposed approaches are applicable to solve this difficult but essential terminal operation problem.
Design of Video Scene Databases with Mapping to Virtual CG Space
Authors: Takashi Tomii, Szabolcs Varga, Sayaka Imai, Hiroshi Arisawa
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a new approach of modeling Video Scenes by adding meaning to the shape of real world objects and simplifying it. In order to store shapes and/or motions of objects that appear in real world scenes into the database, expressing the shape and its meaning and handling them efficiently are indispensable. For that purpose, we introduce a method for constructing a scene database based on an approximate polygon model that reflects the individual shape and meanings of an object, called Shape of Individual Model. It is particularly suitable for modeling the human head. The scene database is constructed using the Shapes of Individual Models and their 3-dimensional motion by mapping them into virtual CG space. And this paper also discusses the evaluation of the created Shape of Individual Model %and the estimation of query processing in an application of the scene database.
A wavelet based entropic approach to high-resolution reconstruction of images
Authors: Said E. El-Khamy, Mohiy M. Hadhoud, Moawad I. Dessouky, Bassiouny M. Salam, Fathi E. Abd El-Samie
Venue: Machine Graphics Vision International Journal (2008)

In multi-channel imaging, when multiple limited resolution sensors are used, we need to extract a high resolution (HR) image from the available low resolution (LR) observations. In this paper, an entropic approach to the HR reconstruction of images is developed. The suggested approach is based on breaking the HR reconstruction problem into three consecutive steps; the multi channel restoration step, the image fusion step and the image interpolation step. In both the first and the last steps, the maximum entropy concept is used to obtain an output HR image with the maximum amount of information. The image fusion step is based on the wavelet approach. The objective of this step is to integrate the data obtained from each observation into a single image, which is then interpolated to give an HR image. The paper explains the necessary approximations required to reduce the computational complexity of each step. The suggested approach has proved to be a computationally efficient for HR reconstruction of images.
A Relational Model of a Parallel and Non-deterministic λ-Calculus
Authors: Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

We recently introduced an extensional model of the pure &lambda;-calculus living in a canonical cartesian closed category of sets and relations [6]. In the present paper, we study the non-deterministic features of this model. Unlike most traditional approaches, our way of interpreting non-determinism does not require any additional powerdomain construction. We show that our model provides a straightforward semantics of non-determinism (may convergence) by means of unions of interpretations, as well as of parallelism (must convergence) by means of a binary, non-idempotent operation available on the model, which is related to the mix rule of Linear Logic. More precisely, we introduce a &lambda;-calculus extended with non-deterministic choice and parallel composition, and we define its operational semantics (based on the may and must intuitions underlying our two additional operations). We describe the interpretation of this calculus in our model and show that this interpretation is sensible with respect to our operational semantics: a term converges if, and only if, it has a non-empty interpretation.
Safer prescribing in intensive care: designing a system to reduce errors
Authors: Kathryn Went
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

Prescribing in intensive care is a complex process involving a number of disciplines working in a highly stressful clinical environment. Within the National Health Service this process is generally written down manually. Errors are made each year as a consequence of illegible or incorrect prescriptions. This research investigates engaging users from multi-disciplines in the design process to result in a system that is usable and demonstrates a reduction in prescribing errors
A Recursive Paradigm to Solve Boolean Relations
Authors: David Baneres, Jordi Cortadella, Mike Kishinevsky
Venue: IEEE Transactions on Computers (2009)

A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean relations. The algorithm has several features: efficiency, wide exploration of solutions, and customizable cost function. The experimental results show the applicability of the method in logic minimization problems and tangible improvements with regard to previous heuristic approaches.
Preconfigured structures for survivable WDM networks
Authors: Bin Wu, Kwan L. Yeung, Pin-Han Ho
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Network survivability against component failure is an important issue in WDM (Wavelength Division Multiplexing) optical networks. This includes failure detection, localization and isolation (i.e. protection or restoration). In this paper, we focus on link-based failure localization and protection in WDM networks. Different preconfigured optical structures including simple, non-simple cycles and trails are discussed, and their applications in fast link failure localization and protection are studied. We generate solutions using ILPs (Integer Linear Programs) and analyze the pros and cons of each structure. Our analysis shows that simple cycles can be regarded as a special case of non-simple cycles, and both simple and non-simple cycles are special cases of trails. Therefore, trails provide the most general and flexible structure to generate the best solutions.
How are Real Grids Used? The Analysis of Four Grid Traces and Its Implications
Authors: Alexandru Iosup, Catalin Dumitrescu, Dick Epema, Hui Li, Lex Wolters
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

The Grid computing vision promises to provide the needed platform for a new and more demanding range of applications. For this promise to become true, a number of hurdles, including the design and deployment of adequate resource management and information services, need to be overcome. In this context, understanding the characteristics of real Grid workloads is a crucial step for improving the quality of existing Grid services, and in guiding the design of new solutions. Towards this goal, in this work we present the characteristics of traces of four real Grid environments, namely LCG, Grid3, and TeraGrid, which are among the largest production Grids currently deployed, and the DAS, which is a research Grid. We focus our analysis on virtual organizations, on users, and on individual jobs characteristics. We further attempt to quantify the evolution and the performance of the Grid systems from which our traces originate. Finally, given the scarcity of the information available for analysis purposes, we discuss the requirements of a new format for Grid traces, and we propose the establishment of a virtual center for workload-based Grid benchmarking data: The Grid Workloads Archive.
Performance Design Rational Framework
Authors: Tad Gonsalves, Kiyoshi Itoh
Venue: Journal of Integrated Design Process Science (2007)

Much research has been done on Design Rationale (DR) in software development. DR consists of the decisions made during the design process and the reasons behind them. It is useful for revising, maintaining, documenting, evaluating, and learning the design. In collaboration, rational methods act as catalysts in clarifying issues and their related trade-offs for the involved participants. The three main issues in DR are the capture, representation and use of DR. However, each of these issues is rather difficult to pursue in practice mostly because of the overhead they create in the design process. In this paper, we discuss the extension of design rationale (DR) to performance design rationale (PDR) for the development of collaborative systems. The Performance Design Rationale Framework (PDRF) addresses the issues of capture, representation and use, and presents an integrated solution. In collaborative systems, near-optimum performance under the given constraints is a requirement. However, performance design is at best taken for granted, or a patch-work solution is worked out when operational problems are discovered in the deployed system. At the planning and design level, the designers hope and expect that the system will function as per the specifications after its implementation. In other words, the designer's knowledge about the system's performance is not explicit; it is only implicit. PDRF aims at capturing this tacit knowledge and representing it explicitly so that it can be used effectively. PDRF consists of three phases - (1) system modelling, (2) performance evaluation, and (3) performance improvement. It is implemented as an integrated environment with each stage seamlessly flowing into the next stage. Real-life collaborative engineering systems are too complex and too messy to allow a neat mathematical formulation. As an alternative strategy, we adopt a descriptive modelling technique known as Multi-Context Map (Map). Since collaborative systems are discrete-event in nature, performance evaluation is carried on by means of a discrete-event simulator. Finally, the performance improvement or parameter-tuning is accomplished by the application of Qualitative Reasoning (QR). The qualitative rules in the performance improvement expert system are the representation of the domain experts' heuristics or rationale for performance design. Especially through the utilization of PDRF in the development of collaborative systems, the design engineers are utilizing the performance design rationale that is embedded in the PDRF.
Generalized polynomial spaces in three variables: computational aspects
Authors: Dana Simian
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The aim of this paper is to present many computational aspects related to polynomial spaces of w-degree. We obtained algorithms for computing the dimension of homogeneous spaces of w-degree n and the exponents of the monomial basis of these spaces. These elements are very important for using these spaces as interpolation spaces. We discuss aspects regarding the complexity of these algorithms and implementation details.
An economical construction for sorting networks
Authors: David C. Van Voorhis
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

An N-input sorting network, or an N-sorter, is a switching circuit with N outputs that satisfy the following: for any combination of inputs I = {ia, i1, ..., iN-1}, the resulting outputs 0 = {o0, o1, ..., oN-1} are a permutation of I, and o0&le;o1&le;...;&le;oN-1. Batcher shows that a basic 2-sorter, or comparator cell, can be used to construct N-sorters for arbitrary N. For example, the circuit in Figure 1 is a 4-sorter, since comparators A through D move the smallest input to o0 and the largest input to o3, and then comparator E orders the remaining two inputs.
Auditory Artifacts due to Switching Head-Related Transfer Functions of a Dynamic Virtual Auditory Display
Authors: Makoto Otani, Tatsuya Hirahara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Auditory artifacts due to switching head-related transfer functions (HRTFs) are investigated, using a software-implemented dynamic virtual auditory display (DVAD) developed by the authors. The DVAD responds to a listener's head rotation using a head-tracking device and switching HRTFs to present a highly realistic 3D virtual auditory space to the listener. The DVAD operates on Windows XP and does not require high-performance computers. A total system latency (TSL), which is the delay between head motion and the corresponding change of the ear input signal, is a significant factor of DVADs. The measured TSL of our DVAD is about 50 ms, which is sufficient for practical applications and localization experiments. Another matter of concern is the auditory artifact in DVADs caused by switching HRTFs. Switching HRTFs gives rise to wave discontinuity of synthesized binaural signals, which can be perceived as click noises that degrade the quality of presented sound image. A subjective test and excitation patterns (EPNs) analysis using an auditory filter are performed with various source signals and HRTF spatial resolutions. The results of the subjective test reveal that click noise perception depends on the source signal and the HRTF spatial resolution. Furthermore, EPN analysis reveals that switching HRTFs significantly distorts the EPNs at the off signal frequencies. Such distortions, however, are masked perceptually by broad-bandwidth source signals, whereas they are not masked by narrow-bandwidth source signals, thereby making the click noise more detectable. A higher HRTF spatial resolution leads to smaller distortions. But, depending on the source signal, perceivable click noises still remain even with 0.5-degree spatial resolution, which is less than minimum audible angle (1 degree in front).
Exploring the analytical processes of intelligence analysts
Authors: George Chin,  Jr., Olga A. Kuchar, Katherine E. Wolf
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present an observational case study in which we investigate and analyze the analytical processes of intelligence analysts. Participating analysts in the study carry out two scenarios where they organize and triage information, conduct intelligence analysis, report results, and collaborate with one another. Through a combination of scenario-based analysis, artifact analysis, role-playing, interviews, and participant observations, we explore the space and boundaries in which intelligence analysts work and operate. We also assess the implications of our findings on the use and application of key information technologies.
High performance architecture of an application specific processor for the H.264 deblocking filter
Authors: Philip Dang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents an efficient architecture of an application specific processor (ASP) designed for the deblocking filter algorithm of the H.264 video compression standard. Several optimization techniques at different design levels, such as vector register, pipeline processing, very long instruction word (VLIW) processor, and predication, are utilized in this design. The proposed ASP can meet the real time constraint of the deblocking filter algorithm for the 16:9 video format (4690 × 2304) at 30 frames per second (fps) at 200-MHz clock rate.
A Combinatorial Approach to Content-Based Music Selection
Authors: Francois Pachet, Daniel Cazaly, Pierre Roy
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and content providers, that we define as the music selection problem. We introduce three main goals to be satisfied in music selection: match user preferences, provide users with new music, and exploit the catalogue in an optimal fashion. We propose a novel approach to music selection, based on computing coherent sequences of music titles, and show that this amounts to solving a combinatorial pattern generation problem. We propose constraint satisfaction techniques to solve it. The resulting system is an enabling technology to build better music delivery services.
Approximated Ground Truth for Stereo and Motion Analysis on Real-World Sequences
Authors: Zhifeng Liu, Reinhard Klette
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper approximates ground truth for real-world stereo sequences and demonstrates its use for the performance analysis of a few selected stereo matching and optical flow techniques. Basically we assume zero roll and constant tilt of an ego-vehicle (for about 10 seconds) driving on a planar road.
Member behavior in company online communities
Authors: Vanessa Rood, Amy Bruckman
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

A growing number of corporations have created sites where customers talk to one another. What kind of interaction takes place on these sites? In this study, we interviewed eleven members of company online communities (COC). We found that while users initially come to such sites looking for product information, they often stay to socialize, and develop meaningful friendships with other members (even turning to one-another for support in times of personal tragedy). We present case studies of interaction on two sites for Campbell's Soup, and for MINI Cooper car owners. We found that users are drawn to these sites because the product's brand image attracts a group of like-minded individuals. Adjectives used to describe the brand are also used to describe site members. I.e., Campbell's is trusting and down-to earth; MINI is fun-loving. Implications for website design are discussed.