ppxscal/embedding_network huggingface dataset:
Towards a Formalisation of Electronic Contracting Environments
Authors: Nir Oren, Sofia Panagiotidi, Javier Vázquez-Salceda, Sanjay Modgil, Michael Luck, Simon Miles
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)

Clauses within contracts may be thought of as norms, specifying permissions, obligations and prohibitions on contract parties. In this paper, we present a formal representation of contracts, focusing on the specification of a model of norms. With this model, a norm is associated with a status, which may change as the environment, and the status of other norms, changes. We define a normative environment, which may be used to track the status of a set of norms throughout their lifecycle, and then describe a predicates that may be used to evaluate a norm's status. Agents are able to use these predicates to reason about the status of norms, and how their actions will affect the normative environment. Finally, we show the applicability of our framework to real world domains by monitoring the execution of a contract taken from a real world scenario.
Formal verification of practical MPI programs
Authors: Anh Vo, Sarvani Vakkalanka, Michael DeLisi, Ganesh Gopalakrishnan, Robert M. Kirby, Rajeev Thakur
Venue: ACM SIGPLAN Notices (2009)

This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our approach, we directly model-check the MPI/C source code, executing its interleavings with the help of a verification scheduler. Unfortunately, the total feasible number of interleavings is exponential, and impractical to examine even for our modest goals. Our earlier publications formalized and implemented a partial order reduction approach that avoided exploring equivalent interleavings, and presented a verification tool called ISP. This paper presents algorithmic and engineering innovations to ISP, including the use of OpenMP parallelization, that now enables it to handle practical MPI programs, including:(i)~ParMETIS - a widely used hypergraph partitioner, and (ii)~MADRE - a Memory Aware Data Re-distribution Engine, both developed outside our group. Over these benchmarks, ISP has automatically verified up to 14K lines of MPI/C code, producing error traces of deadlocks and assertion violations within seconds.
Focus on driving: how cognitive constraints shape the adaptation of strategy when dialing while driving
Authors: Duncan P. Brumby, Dario D. Salvucci, Andrew Howes
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We investigate how people adapt their strategy for interleaving multiple concurrent tasks to varying objectives. A study was conducted in which participants drove a simulated vehicle and occasionally dialed a telephone number on a mobile phone. Experimental instructions and feedback encouraged participants to focus on either driving or dialing. Results show that participants adapted their task interleaving strategies to meet the required task objective, but in a manner that was nonetheless intricately shaped by internal psychological constraints. In particular, participants tended to steer in between dialing chunks of digits even when extreme vehicle drift implied that more reactive strategies would have generated better lane keeping. To better understand why drivers interleaved tasks at chunk boundaries, a modeling analysis was conducted to derive performance predictions for a range of dialing strategies. The analysis supported the idea that interleaving at chunk boundaries efficiently traded the time given up to dialing with the maintenance of a central lane position. We discuss the implications of this work in terms of contributions to understanding how cognitive constraints shape strategy adaptations in dynamic multitask environments.
Using Inherent Service Redundancy and Diversity to Ensure Web Services Dependability
Authors: Anatoliy Gorbenko, Vyacheslav Kharchenko, Alexander Romanovsky
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Achieving high dependability of Service-Oriented Architecture (SOA) is crucial for a number of emerging and existing critical domains, such as telecommunication, Grid, e-science, e-business, etc. One of the possible ways to improve this dependability is by employing service redundancy and diversity represented by a number of component web services with the identical or similar functionality at each level of the composite system hierarchy during service composition. Such redundancy can clearly improve web service reliability (trustworthiness) and availability. However to apply this approach we need to solve a number of problems. The paper proposes several solutions for ensuring dependable services composition when using the inherent service redundancy and diversity. We discuss several composition models reflecting different dependability objectives (enhancement of service availability, responsiveness or trustworthiness), invocation strategies of redundant services (sequential or simultaneous) and procedures of responses adjudication.
The Householder Compressor Theorem and its application in subspace tracking
Authors: Peter Strobach
Venue: Signal Processing (2009)

The energy in a symmetric (r+1)x(r+1) matrix can be transformed perfectly into a smaller rxr submatrix by means of a two-sided Householder transformation. The parameters of this Householder transformation are uniquely determined by the minor eigenvector of the larger matrix. This compressor is the key to a new type of square-root Householder subspace tracker which is optimal in terms of both complexity and performance. Computer experiments validate the theoretical findings.
Efficiency in generalized pipeline networks
Authors: C. V. Ramamoorthy, H. F. Li
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

A common architecture of most of today's super machines revolves around parallel or pipeline processing. Typical examples of such machines are the CDC STAR-100, TI-ASC, PEPE, IBM 360/91, 360/195, and CDC 6600, 7600, etc. They all have distinct pipeline processing capabilities, either in the form of internally pipelined arithmetic functional units or in the form of a pipeline of special purpose functional units. The principal idea behind pipelining is to create as much overlap as possible in the operations of the different facilities, for example, memory fetch unit, decoding units, adders, and multipliers. Concurrency of different operations increases the system utilization. As an important consequence of concurrency, the execution speed of most jobs are accelerated considerably as is evidenced in systems like 360/195 and TI-ASC. Ideally, in a pipelined machine, instead of obtaining one output per major cycle from the system, a rate of one output per minor cycle may be achievable. A typical linear pipeline is as drawn in Figure 1(a).
3D curve structure reconstruction from a sparse set of unordered images
Authors: Zheng Jian-dong, Zhang Li-yan, Du Xiao-yu, Ding Zhi-an
Venue: Computers in Industry (2009)

A flexible and portable approach to reconstructing 3D curve structures of free-form objects from a sparse set of unordered images taken by a hand-held CCD camera is presented. To make the whole pipeline robust and accurate, we mark the interested curves on the object to make them visually outstand from the background. Some specifically designed markers are distributed around the object as well. Followed by an automatic camera pose recovery and camera lens distortion correction step, a user-friendly semi-automatic method is put forward to extract the curves in the images. The curve correspondences in stereo image pairs are then optimally established and the 3D curve structures are recovered by using the stereo triangulation method. Experiments show that the method is applicable for reverse modeling of freeform objects with moderate accuracy requirements.
Content-based Drama Editing based on Inter-media Synchronization
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Automatic image recognition is usually difficult. However, drama is composed of not only image but also sound and script. Therefore, higher level recognition of drama which can not be achieved by the image analysis will be realized by integrating image analysis, sound analysis and document analysis. In this paper, focusing on the semantic descriptions in the script, content-based drama editing based on the inter-media synchronization is proposed. In the proposed method, at first, inter-media synchronization between image, sound and script is carried out using DP matching. Then, the script is edited using ordinary text editor. Finally, the editing of drama is actually carried out by selecting and aligning the image and sound based on the edited script. Therefore, the proposed method can realize effective and semantic-based video editing by handling smaller and more abstracted data of document. The experimental results will reveal the effectiveness of the proposed method. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Levels in Pānini's Aṣṭādhyāyī
Authors: Peter M. Scharf
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

In 1969 Kiparsky and Staal proposed that Pānini's Aṣṭādhyāyī contained a four-level hierarchy of rules. While modifying the interrelation of the levels, Kiparsky (2002) still maintains the four-level hierarchy. R. Rocher (1964: 51) and Cardona (1976: 215-224) argued against such a hierarchy, the former maintaining that Pānini operated just with a two-level hierarchy of meaning and speech. Cardona was willing to accept the propriety of speaking of one intermediate level on the grounds that the assignment of kāraka terms involved both semantic and cooccurrence conditions. The present paper clarifies the issue, argues that the assignment of abstract l-affixes to the same level as kāraka classification by Kiparsky is problematic, that most rules considered to be purely phonetic (sandhi rules) in fact include morphological conditions and concludes that although there are intermediate stages in derivation, Pānini considers there to be just two levels. The semantic and syntactic levels are properly coalesced in a syntacticosemantic level and the abstract morphological and the morphophonemic level are properly coalesced in a single morphophonemic level.
Decoding What People See from Where They Look: Predicting Visual Stimuli from Scanpaths
Authors: Moran Cerf, Jonathan Harel, Alex Huth, Wolfgang Einhäuser, Christof Koch
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Saliency algorithms are applied to correlate with the overt attentional shifts, corresponding to eye movements, made by observers viewing an image. In this study, we investigated if saliency maps could be used to predict which image observers were viewing given only scanpath data. The results were strong: in an experiment with 441 trials, each consisting of 2 images with scanpath data - pooled over 9 subjects - belonging to one unknown image in the set, in 304 trials (69%) the correct image was selected, a fraction significantly above chance, but much lower than the correctness rate achieved using scanpaths from individual subjects, which was 82.4%. This leads us to propose a new metric for quantifying the importance of saliency map features, based on discriminability between images, as well as a new method for comparing present saliency map efficacy metrics. This has potential application for other kinds of predictions, e.g., categories of image content, or even subject class.
Teaching Soft Facts in Requirements Engineering Using Improvisation Theatre Techniques
Authors: Anne Hoffmann
Venue: Proceedings of the 2008 Third International Workshop on Multimedia and Enjoyable Requirements Engineering - Beyond Mere Descriptions and with More Fun and Games (2008)

When teaching requirements engineering, we need to teach the so called human factor. However, traditionally we concentrate on hard facts such as how to identify and consolidate requirements. Thus, experiencing soft facts is left aside. Here, we propose a way to instruct soft facts in requirements engineering, using improvisation theatre techniques, and therefore helping the participants to experience the human factor. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Low Cost SoC Design of H.264/AVC Decoder for Handheld Video Player
Authors: Sumek Wisayataksin, Dongju Li, Tsuyoshi Isshiki, Hiroaki Kunieda
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We propose a low cost and stand-alone platform-based SoC for H.264/AVC decoder, whose target is practical mobile applications such as a handheld video player. Both low cost and stand-alone solutions are particularly emphasized. The SoC, consisting of RISC core and decoder core, has advantages in terms of flexibility, testability and various I/O interfaces. For decoder core design, the proposed H.264/AVC coprocessor in the SoC employs a new block pipelining scheme instead of a conventional macroblock or a hybrid one, which greatly contribute to reducing drastically the size of the core and its pipelining buffer. In addition, the decoder schedule is optimized to block level which is easy to be programmed. Actually, the core size is reduced to 138 KGate with 3.5 kbyte memory. In our practical development, a single external SDRAM is sufficient for both reference frame buffer and display buffer. Various peripheral interfaces such as a compact flash, a digital broadcast receiver and a LCD driver are also provided on a chip.
An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1,Xp)-medianoid problem on trees
Authors: J. Spoerhase, H. -C. Wirth
Venue: Information Processing Letters (2009)

The single maximum coverage location problem on a tree consists of placing one facility onto a node such that the total weight of users covered by the facility is maximized. Users are located at nodes of the tree. Each user has an individual sensitivity radius and is covered if and only if the facility is placed within that radius. This problem is a generalization of the (1,X"p)-medianoid problem (Hakimi, 1990). We provide a recursive graph coarsening algorithm which improves the running time from O(n^2) (Megiddo, 1983) to O(n(logn)^2/loglogn).
The angle mouse: target-agnostic dynamic gain adjustment based on angular deviation
Authors: Jacob O. Wobbrock, James Fogarty, Shih-Yen (Sean) Liu, Shunichi Kimuro, Susumu Harada
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present a novel method of dynamic C-D gain adaptation that improves target acquisition for users with motor impairments. Our method, called the Angle Mouse, adjusts the mouse C-D gain based on the deviation of angles sampled during movement. When angular deviation is low, the gain is kept high. When angular deviation is high, the gain is dropped, making the target bigger in motor-space. A key feature of the Angle Mouse is that, unlike most pointing facilitation techniques, it is target-agnostic, requiring no knowledge of target locations or dimensions. This means that the problem of distractor targets is avoided because adaptation is based solely on the user's behavior. In a study of 16 people, 8 of which had motor impairments, we found that the Angle Mouse improved motor-impaired pointing throughput by 10.3% over the Windows default mouse and 11.0% over sticky icons. For able-bodied users, there was no significant difference among the three techniques, as Angle Mouse throughput was within 1.2% of the default. Thus, the Angle Mouse improved pointing performance for users with motor impairments while remaining unobtrusive for able-bodied users.
Generating cutter swept envelopes in five-axis milling by two-parameter families of spheres
Authors: Eyyup Aras
Venue: Computer-Aided Design (2009)

This paper presents an efficient parametric approach of determining the shape of the envelope surface by a generalized cutter that follows five-axis tool path during NC machining. In this approach the cutter is modeled as a canal surface. By considering the tool motions the cutter is decomposed into a set of characteristic and great circles which are generated by two-parameter families of spheres. The center of a sphere from these families is described by two parameters which represent the spine curve and the tool path, and the radius of the sphere is described by one parameter representing the spine curve. Considering the relationship between characteristic and great circles the grazing points on the tool surface are identified. Analytically it is proven for the NC cutter geometries that any point on the envelope surface is located at the intersection of the characteristic and great circles. Then based on the proofs a closed-form solution for computing the grazing points generated by a surface of revolution is presented. The presented methodology is reduced to a simpler parametric form when the NC cutters are described by pipe surfaces.
Some programming techniques for processing multi-dimensional matrices in a paging environment
Authors: James L. Elshoff
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Although virtual memory systems are supposed to free the programmer from space management problems, the systems do not always succeed. In fact, programmers find that by ignoring the fact that real core is limited, the cost of executing their programs sometimes makes them unusable, not to mention some of the detrimental effects the program has on the throughput of the overall system. This problem seems to be especially prevalent when large matrices of data are involved. The data are usually referenced in a cyclical pattern and when the entire matrix will not fit in core, the number of page faults encountered during execution is maximized. The focus of this paper is to analyze programming techniques which will reduce the number of page faults in matrix operations and thereby improve program performance.
Multiuser detection using adaptive multistage matrix wiener filtering schemes with stage-selection criteria in DS-UWB
Authors: Chia-Chang Hu, Hsuan-Yu Lin
Venue: EURASIP Journal on Advances in Signal Processing (2008)

Adaptive reduced-rank (RR) multistage matrix Wiener filtering (MMWF) techniques, based on the minimum mean-square error (MMSE) criterion, are proposed for direct-sequence (DS) ultra-wideband (UWB) communication systems. These RR-MMWF-based algorithms employ an adaptive fuzzy-inference determined filter stage. As a consequence, the proposed schemes achieve a substantial saving in complexity without compromising system performance and dynamic convergence/tracking capability. Additionally, the fuzzy-logic-controlled matrix conjugate gradient (MCG) algorithm is developed for a robust and reduced-rank implementation of the full-rank MMWF. Simulations are conducted to illustrate the convergence/tracking superiority and to provide a comparative evaluation of the proposed algorithms with the MMWF-based schemes using other adaptive stage-selecting criteria.
Information Systems Essentials, 3rd edition
Authors: Stephen Haag, Maeve Cummings
Venue:  (2008)

A concise, four-color IS concepts book with a lively, contemporary writing style at a student-friendly price. Information Systems Essentials Information Systems Essentials comes with more and better ancillaries than any other essentials text.An additional unique feature is the opening unit, explaining the benefit and impact of IS on each business career. This chapter addresses the frequently-cited problem of effectively showing students the relevance of this course.Information Systems Essentials includes the first nine chapters from Haag MIS 5e, representing what introductory MIS students should definitely know. An appendix includes the two XLMs from Haag MIS 5e: hardware/software and telecommunications.
Optimal Control Based on a General Exponential Scheduling Rule for a Generalized Switch
Authors: Wanyang Dai, Shi Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

We design a general exponential scheduling rule for a generalized switch system, which includes many systems as special cases such as the system of multiuser data scheduling over a wireless medium, the input-queued cross-bar switch and a discrete time version of a parallel server queueing system. Multiple flows must be served by the switch and the switch state changes in time randomly and asynchronously for different users. The designed scheduling rule picks flows for service based on the current state of the switch and the queues explicitly, which avoids any knowledge requirements of input rates and switch statistics and hence overcomes the disadvantage of existing MaxWeight scheduling rule. Moreover, we prove that this rule is throughput-optimal (i.e., it makes the queues stable if there exists any rule which can do so) and is to minimize certain form of workload (i.e., minimize certain form of queue-lengths or delays).
Modeling the dynamics of voltage-controlled oscillators by combining modified volterra series with an envelope transient formulation
Authors: Jacobo Domínguez, Sergio Sancho, Almudena Suárez
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper, a behavioral model for frequency-modulated microwave voltage-controlled oscillators (VCO) is presented. The so-called "Deviation-Reduction" Volterra series are applied to model the VCO dynamics, building a black box model for the VCO when applying modulation signals to the tuning voltage. The output signal is obtained by making use of an envelope transient formulation. The model can be built from simulation or measured data.
On the refutational completeness of signed binary resolution and hyperresolution
Authors: Dušan Guller
Venue: Fuzzy Sets and Systems (2009)

Signed binary resolution and hyperresolution belong to the basic resolution proof methods. Both the resolution methods are refutation sound and, under some finitary restrictions, refutation complete. Our aim is to investigate their refutational completeness in a more general case. We shall assume that clausal theories may be countable sets and the set of truth values an arbitrary one. There are unsatisfiable countable clausal theories for which there do not exist refutations by signed binary resolution and hyperresolution. We propose a criterion on the existence of a refutation of an unsatisfiable countable clausal theory by the investigated resolution methods. Two important applications of the achieved results to automated deduction in signed logic: Herbrand's theorem and a signed Davis-Putnam-Logemann-Loveland (DPLL) procedure will be discussed.