ppxscal/embedding_network huggingface dataset:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Authors: Thomas Chatain, Paul Gastin, Nathalie Sznajder
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We study the synthesis problem in an asynchronous distributed setting: a finite set of processes interact locally with an uncontrollable environment and communicate with each other by sending signals --- actions that are immediately received by the target process. The synthesis problem is to come up with a local strategy for each process such that the resulting behaviours of the system meet a given specification. We consider external specifications over partial orders. External means that specifications only relate input and output actions from and to the environment and not signals exchanged by processes. We also ask for some closure properties of the specification. We present this new setting for studying the distributed synthesis problem, and give decidability results: the non-distributed case, and the subclass of networks where communication happens through a strongly connected graph. We believe that this framework for distributed synthesis yields decidability results for many more architectures.
Improving patient motivation in game development for motor deficit rehabilitation
Authors: Eletha Flores, Gabriel Tobon, Ettore Cavallaro, Francesca I. Cavallaro, Joel C. Perry, Thierry Keller
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

It has been stated repeatedly that active participation in rehabilitation programs increases the benefit and effectiveness of therapy. In developing robotic devices for stroke rehabilitation, the existing use of boring task interfaces produces a significant reduction in elderly patient motivation. To combine robot-aided therapy with appealing games, then, is not only a matter of creating entertainment, but a real necessity for motor recovery. Besides emphasizing a lack of attention to elderly patients in conceiving games for post-stroke rehabilitation, this paper launches a challenge to two fields with tremendous collaborative potential. As a precursor to this collaboration, the following research consolidates the gaming scenario criteria for both rehabilitation and elderly entertainment. Conclusions are then formed from the adaptability of existing games to identify the direction of future game development.
A New Rights Processing Method for DRM Systems
Authors: Lei Wang, Peiyu Guo, Jinhui Xie, Yingying Yao, Jinchun Liang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

There are many solutions and standards about digital rights management(DRM) now. Almost all the solutions used cryptography and rights processing technologies to protect contents. Only legal users can decrypt and enjoy contents under the control of rights information, illegal users are prohibited. Rights processing technologies include rights expression languages (REL), binary encoding method, virtual machine, and so on. ODRL (Open Digital Rights Language) and XrML (eXtensible Markup Language) are all RELs, which express rights based on XML. Broadcasting flag encodes copy control information into binary data block. Marlin DRM uses Plankton virtual machine to process rights information. In this paper, we provided a rights processing method which is based on ASN.1(Abstract Syntax Notation One) syntax and using ASN.1 distinguishable encoding rule (DER) to encode rights information into binary data block. Compared with RELs, this rights processing method uses less bits to express rights information and can save more bandwidth during transmission. And it can express more rights information than broadcast flag.
Fully Pipelined Hardware Implementation of 128-Bit SEED Block Cipher Algorithm
Authors: Jaeyoung Yi, Karam Park, Joonseok Park, Won W. Ro
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

As the need for information security increases in our everyday life, the job of encoding/decoding for secure information delivery becomes a critical issue in data network systems. High-speed data encoding for cryptography is required especially when sending a large amount of important data with high-speed transmission. In order to accomplish the procedure more efficiently, previous research focused on implementing existing algorithms using hardware accelerators. In this paper, we discuss and propose the FPGA implementation of the SEED block cipher algorithm, which is a Korean national industrial association standard for secured systems. Our implementation, which is written in Verilog HDL, is synthesized and tested on a Virtex-V XC5LX110T FPGA device. Our results show that the proposed fully pipelined design achieves high throughput and can support as high as 6.4 Gbps network speed. Compared to a full software implementation on the Intel Core 2 Duo 2.53 GHz processor, our implementation provides 34 times higher performance in terms of encoding/decoding throughput.
Access Control Scheme for Workflow
Authors: Lijun Gao, Lu Zhang, Lei Xu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Access control is an important security measure in workflow system. Based on the analysis of many access control models, by emphasizing the weakness existing in the present workflow system, a new access control model is proposed with the introduction of task set, task flow, time constraint and the formalized definition and relevant algorithm. It overcomes the shortcomings of the traditional model based on the role access control that has bad dynamic adaptivity of authority assigning, no flow control and time constraint. The model can therefore enhance the security and practicability of the workflow system.
On the Server Placement Problem of P2P Live Media Streaming System
Authors: Zhijia Chen, Chuang Lin, Hao Yin, Bo Li
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Commercial P2P media streaming systems have widely utilized servers or Content Distribution Networks (CDN) service to help alleviating the effect from high peer dynamics. While refocusing on servers becomes a MUST in large-scale commercial P2P streaming systems, it comes to the problem on how to place server nodes in best efficiency so that they can better serve the needs of peers with minimal cost. In line with this, we formulate the Server Placement (SP) problem in P2P streaming system, and propose solution schemes for the sub-problem of server selection and rate assignment. The server selection problem targets at minimizing the end-to-end user round-trip latency, and traffic transmission cost, which was finally reduced to a P-median problem and solved by Greedy Randomized Adaptive Search Procedure (GRASP). Secondly, we formulate the problem of which clients are served by which server at which rate as the rate allocation problem and optimize to minimize the total streaming cost subject to the play rate requirement. As a starting work, this paper aims to attract more researches on this challenging topic.
A restarting approach for the symmetric rank one update for unconstrained optimization
Authors: Wah June Leong, Malik Abu Hassan
Venue: Computational Optimization and Applications (2009)

Two basic disadvantages of the symmetric rank one (SR1) update are that the SR1 update may not preserve positive definiteness when starting with a positive definite approximation and the SR1 update can be undefined. A simple remedy to these problems is to restart the update with the initial approximation, mostly the identity matrix, whenever these difficulties arise. However, numerical experience shows that restart with the identity matrix is not a good choice. Instead of using the identity matrix we used a positive multiple of the identity matrix. The used positive scaling factor is the optimal solution of the measure defined by the problem--maximize the determinant of the update subject to a bound of one on the largest eigenvalue. This measure is motivated by considering the volume of the symmetric difference of the two ellipsoids, which arise from the current and updated quadratic models in quasi-Newton methods. A replacement in the form of a positive multiple of the identity matrix is provided for the SR1 update when it is not positive definite or undefined. Our experiments indicate that with such simple initial scaling the possibility of an undefined update or the loss of positive definiteness for the SR1 method is avoided on all iterations.
'Helpfulness' in online communities: a measure of message quality
Authors: Jahna Otterbacher
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Online communities displaying textual postings require measures to combat information overload. One popular approach is to ask participants whether or not messages are helpful in order to then guide others to interesting content. Adopting a well-established framework for assessing data quality, we examine the nature of "helpfulness."We study consumer reviews at Amazon.com, deriving 22 measures quantifying their textual properties, authors' reputations and product characteristics. Confirmatory factor analysis reveals five underlying quality dimensions representing reviewers' reputations in the community, the topical relevancy of the reviews, the ease of understanding them, their believability and objectivity. A correlation and regression analysis confirms that these dimensions are related to the helpfulness scores assigned by community participants. However, it also uncovers a strong relationship between the chronological ordering of reviews and helpfulness, which both community participants and designers should keep in mind when using this method of social navigation.
IUI'09 workshop summary: sketch recognition
Authors: Tracy Anne Hammond
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

This paper describes the IUI'09 workshop on Sketch Recognition.
Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks
Authors: Gunnar Schaefer, François Ingelrest, Martin Vetterli
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions nevertheless occur. Opportunistic routing limits these retransmissions by taking advantage of the broadcast nature of the wireless channel: sending packets to multiple receivers at once, and only then, based on the outcome, choosing the actual next hop [1]. In this paper, we first study the potentials of opportunistic routing in energy-constrained wireless sensor networks. In particular, the reduction of retransmissions due to the broadcast advantage is balanced with the arising need for coordination to avoid duplicate packets. We then propose Coordinated Anypath Routing, an opportunistic routing protocol designed for wireless sensor networks, in which the coordination between receivers is handled by an overhearing-based acknowledgment scheme. Our protocol may be used to minimize either retransmissions or power consumption, and our simulation results show that, with lossy links, energy savings go up to 7%, even for small networks of 20 nodes.
AOJS: aspect-oriented javascript programming framework for web development
Authors: Hironori Washizaki, Atsuto Kubo, Tomohiko Mizumachi, Kazuki Eguchi, Yoshiaki Fukazawa, Nobukazu Yoshioka, Hideyuki Kanuka, Toshihiro Kodaka, Nobuhide Sugimoto, Yoichi Nagai, Rieko Yamamoto
Venue: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (2009)

JavaScript is a popular scripting language that is particularly useful for client-side programming together with HTML /XML on the Web. As JavaScript programs become more complex and large, separation of concerns at the implementation level is a significant challenge. Aspect orientation has been a well known concept to realize improved separation; however, existing mechanisms require modifications in the target modules for aspect weaving in JavaScript (i.e., not "complete" separation). In this paper, we propose an Aspect-Oriented JavaScript framework, named "AOJS", which realizes the complete separation of aspects and other core modules in JavaScript. AOJS can specify function executions, variable assignments and file initializations in JavaScript programs as the joinpoints of aspects. Moreover, AOJS guarantees the complete separation of aspects and core program modules by adopting a proxy-based architecture for aspect weaving. By utilizing these features, we confirmed that AOJS offers improved modifiability and extendability for JavaScript programming.
Uncovering cognitive processes: Different techniques that can contribute to cognitive load research and instruction
Authors: Tamara van Gog, Liesbeth Kester, Fleurie Nievelstein, Bas Giesbers, Fred Paas
Venue: Computers in Human Behavior (2009)

This article discusses the use of different techniques for uncovering cognitive processes, for research and instructional purposes: verbal reporting, eye tracking, and concept mapping. It is argued here that applying these techniques in research inspired by cognitive load theory may increase our understanding of how and why well-known effects of instructional formats come about (e.g., split-attention, redundancy, or worked example effects) and refine or corroborate the proposed theoretical underpinnings of such effects. This knowledge can inform instructional design, and moreover, the effects of these techniques on learning can also be direct, by embedding the techniques in instruction.
Automated transformation for performance-critical kernels
Authors: Qing Yi, R. Clint Whaley
Venue: Proceedings of the 2007 Symposium on Library-Centric Software Design (2007)

The performance of many scientific applications depends on a small number of key computational kernels which require a level of efficiency rarely satisfied by existing native compilers. We present a new approach to high performance kernel optimization, where a general-purpose transformation engine automates the production of highly efficient library routines. The library routines are then empirically tested until an implementation with a satisfactory performance level is found. Our framework requires an annotated kernel specification and can automatically produce optimized implementations based on tuning parameters controlled by a search driver. The transformation engine includes an extensive suite of optimizations which can be easily expanded using a custom transformation language. We have applied our framework to generate code for key linear algebra kernels and have achieved similar performance as that achieved by ATLAS's highly tuned kernels. In several cases, our kernels were faster than ATLAS's native kernels; we have made these kernels available to ATLAS, which results in speedups for the ATLAS library, as we show.
Wavelet-based acoustic detection of moving vehicles
Authors: Amir Averbuch, Valery A. Zheludev, Neta Rabin, Alon Schclar
Venue: Multidimensional Systems and Signal Processing (2009)

We propose a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals to detect the arrival of a vehicle of arbitrary type when other noises are present. To achieve it with minimum number of false alarms, we combine a construction of a training database of acoustic signatures signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients with a procedure of random search for a near-optimal footprint. The number of false alarms in the detection is minimized even under severe conditions such as: the signals emitted by vehicles of different types differ from each other, whereas the set of non-vehicle recordings (the training database) contains signals emitted by planes, helicopters, wind, speech, steps, etc. The proposed algorithm is robust even when the tested conditions are completely different from the conditions where the training signals were recorded. The proposed technique has many algorithmic variations. For example, it can be used to distinguish among different types of vehicles. The proposed algorithm is a generic solution for process control that is based on a learning phase (training) followed by an automatic real-time detection.
Constrained ZIP code segmentation by a PCNN-based thinning algorithm
Authors: Lifeng Shang, Zhang Yi, Luping Ji
Venue: Neurocomputing (2009)

This paper proposes a novel thinning algorithm and applies it to automatic constrained ZIP code segmentation. The segmentation method consists of two main stages: removal of rectangle boxes and location of ZIP code digits. Both the two stages are implemented on the skeleton of boxes, which is extracted by the proposed pulse coupled neural network (PCNN) based thinning algorithm. This algorithm is specially designed to merely skeletonize the boxes. At the second stage, a projection method is employed to segment ZIP code image into its constituent digits. Experimental results show that the proposed method is very efficient in segmenting ZIP code images even with noise.
The Art of Non-asserting: Dialogue with Nāgārjuna
Authors: Marie-Hélène Gorisse
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

In his excellent paper, Nāgārjuna as anti-realist, Siderits showed that it makes sense to perform a connection between the position of the Buddhist Nāgārjuna and contemporary anti realist theses such as Dummett's one. The point of this talk is to argue that this connection is an important one to perform for one's correct understanding of what Nāgārjuna is doing when he criticizes the contemporary Indian theories of knowledge and assertion, first section, but as soon as the theories of argumentation are involved, this connection can be implemented in a better way from an other anti realist perspective, namely the one of Dialogical logic (Erlangen school), in which the signification is given in terms of rules in a language game. The philosophical issues are to hold an interpretation of the type of assertion performed by Nāgārjuna. We here aim at making a rational reconstruction of his chief claim 'I do not assert any proposition' in which a proposition is considered as the set of its strategies of justification. As for the last section, the point will be to apply these analyses to Buddhist practice. We will in this section consider the conventional character of human activities as the fact that any speech act is performed within a dialogue under ad-hoc restrictions; and the question of one's progress in the soteriological path to liberation will be asked. 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
Two-phase screening procedure for simulation experiments
Authors: Susan M. Sanchez, Hong Wan, Thomas W. Lucas
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2009)

Analysts examining complex simulation models often conduct screening experiments to identify important factors. The controlled sequential bifurcation screening procedures CSB and CSB-X use a sequence of tests to classify factors as important or unimportant, while controlling Type I error and power. These procedures require analysts to identify the directions of the effects prior to experimentation, which can be problematic. We propose hybrid two-phase approaches, FFCSB and FFCSBX, as alternatives. Phase 1 uses an efficient fractional factorial to estimate factor effect directions; phase 2 uses CSB or CSB-X. Empirical investigations show these outperform CSB(X) in efficiency and effectiveness for many situations of practical interest.
Customizable bit-width in an OpenMP-based circuit design tool
Authors: Timothy F. Beatty, Eric E. Aubanel, Kenneth B. Kent
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

As transistor density grows, increasingly complex hardware designs are implemented. In order to manage this complexity, hardware design can be performed at a higher level of abstraction. High level synthesis enables the automatic conversion of algorithms into hardware implementations, abstracting away the underlying complexities of hardware from the designer. A number of high level synthesis tools have recently been developed, including an OpenMP to Handel-C translator. Improvements to the translator, including a new compiler directive allowing customizable register width, are described. Using a set of benchmark tests, the OpenMP to Handel-C translator is evaluated on several criteria, with the goal of evaluating the variable bit-width effects and identifying further areas for improvement.
Enhancing the Serviceability and the Availability of IMS-Based Multimedia Services: Avoiding Core Service Failures
Authors: M. Boucadair, P. Morand, I. Borges, M. Tomsu
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The delivery of a highly available and robust service offering is one of the critical objectives of Service Providers. Reaching this objective depends on the level of control Service Providers have on underlying transport infrastructure. Despite current deployment of IMS-based architectures assumes a vertical integration, IMS-based services can be offered without having a control on the underlying IP network. This paper introduces a solution to enhance the robustness of IMS-based architectures without assuming a vertically integrated system. The paper focuses on failures experienced by core service nodes and describes an autonomic solution to allow customers to access to the service during failures. This paper introduces a novel entity called SBC_PROXY which relays messages from peer SBCs (Session Border Controller) to core service platform. An autonomous mode in which all SBCs are involved in the lookup and routing processes is also described. This paper does not make any assumption on the nature of the service which is offered through IMS. Nevertheless, a focus is put on session-based services such as Audio/Video Telephony.