ppxscal/embedding_network huggingface dataset:
A context- and role-driven scientific workflow development pattern
Authors: Wanchun Dou, Jinjun Chen, Shaokun Fan, S. C. Chueng
Venue: Concurrency and Computation: Practice Experience (2008)

Scientific workflow execution often demands data-centric and computation-intensive collaboration efforts, which is typically different from the process-centric workflow execution with fixed execution specifications. Scientific workflow execution often challenges the traditional workflow development strategy in dynamic context management and role definition. In view of this observation, application context spectrums are firstly distinguished from different profiles of scientific workflow development. Then, a role enactment strategy is proposed for enabling workflow execution in certain application context. They jointly enhance the validity of a scientific workflow development through clearly articulating the correlation between computational subjects and computational objects engaged in scientific workflow system. Furthermore, a novel context- and role-driven scientific workflow development pattern is proposed for enacting a scientific workflow system on the Grid. Finally, a case study is presented to demonstrate the generic natures of the methods in this paper. Copyright &copy; 2008 John Wiley & Sons, Ltd.
The Moderating Impact of Perceived Organizational Support on the Relationship between Technostress and Role Stress
Authors: Kanliang Wang, Qin Shu
Venue: Proceedings of the 2008 19th International Conference on Database and Expert Systems Application (2008)

The study examined whether employees perceived high technostress are destined to experience role stress at a higher level than those perceived low technostress. We used data collected from 450 employees to investigate the moderating effects of perceived organizational support on the relationship between technostress and role stress. The result indicates that: (1) technostress perceived by employees is positively related to role stress; (2) perceived organizational support moderates the relationship between technostress and role conflict such that the relationship will be negative when perceived organizational support is higher; (3) perceived organizational support doesn't significantly moderates the relationship between technostress and role overload. The paper contributes in two ways: First, the paper validate the negative impact of technostress in organization theoretically; Second, the significant moderating of perceived organizational support imply the negative impact of technology can be mend by the change of “social system” in modern organization regarded as a socio-technical system.
Comparison of NIST and Wavelet Transform Test Point Selection Methods For a Programmable Gain Amplifier
Authors: Xinsong Zhang, Simon S. Ang, Chandra Carter
Venue: Journal of Electronic Testing: Theory and Applications (2008)

A comparison of test point selection methods using a linear matrix model based on the National Institute of Standard method and wavelet transform to reduce the number of test points, and hence, the test time, for a programmable gain amplifier (PGA) was investigated. The concept of integral nonlinearity (INL) was used to predict the performance of the PGA. It was found that the NIST method retained the original properties of the INL of the PGA. As such, the NIST method is able to predict the test responses of the PGA much more accurately than the wavelet transform method, using only 3 test points instead of the 155 test points as required in a full test.
Proactive RSA with Non-interactive Signing
Authors: Stanisław Jarecki, Josh Olsen
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We show the first proactive RSA scheme with a fully non-interactive signature protocol. The scheme is secure and robust with the optimal threshold of t < n/2 corruptions. Such protocol is very attractive in practice: When a party requesting a signature contacts t¿ > t among n trustees which implement a proactive RSA scheme, the trustees do not need to communicate between each other, and simply respond with a single "partial signature" message to the requester, who can reconstruct the standard RSA signature from the first t + 1 responses he receives. The computation costs incurred by each party are comparable to standard RSA signature computation.Such non-interactive signature protocol was known for threshold RSA [1], but previous proactive RSA schemes [2,3] required all trustees to participate in the signature generation, which made these schemes impractical in many networking environments. On the other hand, proactivity, i.e. an ability to refresh the secret-sharing of the signature key between the trustees, not only makes threshold cryptosystems more secure, but it is actually a crucial component for any threshold scheme in practice, since it allows for secure replacement of a trustee in case of repairs, hardware upgrades, etc. The proactive RSA scheme we present shows that it is possible to have the best of both worlds: A highly practical non-interactive signature protocol and an ability to refresh the secret-sharing of the signature key. This brings attack-resilient implementations of root sources of trust in any cryptographic scheme closer to practice.
Model Fusion Experiments for the CLSR Task at CLEF 2007
Authors: Muath Alzghool, Diana Inkpen
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents the participation of the University of Ottawa group in the Cross-Language Speech Retrieval (CL-SR) task at CLEF 2007. We present the results of the submitted runs for the English collection. We have used two Information Retrieval systems in our experiments: SMART and Terrier, with two query expansion techniques: one based on a thesaurus and the second one based on blind relevant feedback. We proposed two novel data fusion methods for merging the results of several models (retrieval schemes available in SMART and Terrier). Our experiments showed that the combination of query expansion methods and data fusion methods helps to improve the retrieval performance. We also present cross-language experiments, where the queries are automatically translated by combining the results of several online machine translation tools. Experiments on indexing the manual summaries and keywords gave the best retrieval results.
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
Authors: Julien Bringer, Hervé Chabanne, Thomas Icart
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In 2004, Molnar and Wagner introduced a very appealing protocol dedicated to the identification of RFID tags. Their scheme relies on a binary tree of secrets which are shared --- for all nodes except the leaves --- amongst the tags. Hence the compromise of one tag also has implications on the other tags with whom it shares keys. We describe a new man-in-the-middle attack against this protocol which allows to break privacy even without opening tags. Moreover, it can be applied to some other RFID protocols which use correlated keys as the one described recently by Damgård and Pedersen at CT-RSA 2008.We introduce a modification of the initial scheme to allow us to thwart this and to strengthen RFID tags by implementing secrets with Physical Obfuscated Keys (POKs). This doing, we augment tags and scheme privacy, particularly general resistance against physical threats.
Formal Verification by Reverse Synthesis
Authors: Xiang Yin, John C. Knight, Elisabeth A. Nguyen, Westley Weimer
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

In this paper we describe a novel yet practical approach to the formal verification of implementations. Our approach splits verification into two major parts. The first part verifies an implementation against a low-level specification written using source-code annotations. The second extracts a high-level specification from the implementation with the low-level specification, and proves that it implies the original system specification from which the system was built. Semantics-preserving refactorings are applied to the implementation in both parts to reduce the complexity of the verification. Much of the approach is automated. It reduces the verification burden by distributing it over separate tools and techniques, and it addresses both functional correctness and high-level properties at separate levels. As an illustration, we give a detailed example by verifying an optimized implementation of the Advanced Encryption Standard (AES) against its official specification.
Tutor Project: An Intelligent Tutoring System to Improve Cognitive Disabled People Integration
Authors: J. Rubio, C. Vaquero, J. M. López De Ipiña, E. Irigoyen, K. L. Ipiña, N. Garay, A. Conde, M. Larrañaga, A. Ezeiza, A. Soraluze, M. Peñagarikano, G. Bordel, L. J. Rodríguez, J. M. López, M. Ezquerra, D. Oregi
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Nowadays, the integration of people with cognitive disabilities, especially in the work environment in a growing competitive market, is a difficult task. The TUTOR project is addressed to the development and testing of an Intelligent Tutoring System (ITS). The ITS runs on a handheld device and its aim is to increase the autonomy of people with cognitive disabilities in labour and daily life activities, therefore, improving the social and labour integration of this collective and its quality of live. This paper describes the objectives of this project, the methodology followed, some preliminary achieved results and the future planned activities of this research group.
Training Statistical Language Models from Grammar-Generated Data: A Comparative Case-Study
Authors: Beth Ann Hockey, Manny Rayner, Gwen Christian
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Statistical language models (SLMs) for speech recognition have the advantage of robustness, and grammar-based models (GLMs) the advantage that they can be built even when little corpus data is available. A known way to attempt to combine these two methodologies is first to create a GLM, and then use that GLM to generate training data for an SLM. It has however been difficult to evaluate the true utility of the idea, since the corpus data used to create the GLM has not in general been explicitly available. We exploit the Open Source Regulus platform, which supports corpus-based construction of linguistically motivated GLMs, to perform a methodologically sound comparison: the same data is used both to create an SLM directly, and also to create a GLM, which is then used to generate data to train an SLM. An evaluation on a medium-vocabulary task showed that the indirect method of constructing the SLM is in fact only marginally better than the direct one. The method used to create the training data is critical, with PCFG generation heavily outscoring CFG generation.
Complexity Aspects of Image Classification
Authors: Andreas A. Albrecht
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Feature selection and parameter settings for classifiers are both important issues in computer-assisted medical diagnosis. In the present paper, we highlight some of the complexity problems posed by both tasks. For the feature selection problem we propose a search-based procedure with a proven time bound for the convergence to optimum solutions. Interestingly, the time bound differs from fixed-parameter tractable algorithms by an instance-specific factor only. The stochastic search method has been utilized in the context of micro array data classification. For the classification of medical images we propose a generic upper bound for the size of classifiers that basically depends on the number of training samples only. The evaluation on a number of benchmark problems produced a close correspondence to the size of classifiers with best generalization results reported in the literature.
Relationship between Viewing Distance and Visual Fatigue in Relation to Feeling of Involvement
Authors: Kiyomi Sakamoto, Shoichi Aoyama, Shigeo Asahara, Kuniko Yamashita, Akira Okada
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In this study, we carried out experiments to measure the effect of viewing distance on visual fatigue using two kinds of visual content. Both experiments showed that visual fatigue reached a minimum at a distance of 3 to 4 times the height of the display (3---4H) and that sympathetic nerve activity peaked at around 3H. These results indicate that the viewing distance for less visual fatigue and a closer feeling of involvement might be in between the two distances. These indices, which we adopt in this study, have the potential to be effective evaluation indices for measuring visual fatigue taking feeling of involvement into consideration.
From the Editor in Chief: Fresh Perspectives, New Ideas to Start 2004
Authors: Frank Ferrante
Venue: IT Professional (2004)

Welcome to a new year of IT Professional. Our editorial board enters this year optimistic that the technical recession of the last two years finally appears to be easing.
Inter-turn Short Circuit and Unbalanced Voltage Pattern Recognition for Three-Phase Induction Motors
Authors: Rodrigo López Cárdenas, Luis Pastor Sánchez Fernández, Oleksiy Progrebnyak, Ángel Alberto Costa Montiel
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

A novel diagnostic approach, by means pattern recognition, is proposed for the early detection of inter-turn short circuit on three-phase induction motor and unbalanced input voltage detection. The essential concept is that a minimum inter-turn short circuit at stator motor or unbalanced input voltage produces a slight variation that can be identified in current and rotor speed signals. To achieve this, an own motor mathematical model was created, and in order to generalize the diagnostic for a wide range of motor, is used a novel method to calculate motor parameters through data catalogue. Through this, motors of different power and poles number are emulated and, from these results, an original methodology to transform temporal response in patterns is created.
Scalable Shape Analysis for Systems Code
Authors: Hongseok Yang, Oukseh Lee, Josh Berdine, Cristiano Calcagno, Byron Cook, Dino Distefano, Peter O'Hearn
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Pointer safety faults in device drivers are one of the leading causes of crashes in operating systems code. In principle, shape analysis tools can be used to prove the absence of this type of error. In practice, however, shape analysis is not used due to the unacceptable mixture of scalability and precision provided by existing tools. In this paper we report on a new join operation ${\sqcup\dagger}$ for the separation domain which aggressively abstracts information for scalability yet does not lead to false error reports. ${\sqcup\dagger}$ is a critical piece of a new shape analysis tool that provides an acceptable mixture of scalability and precision for industrial application. Experiments on whole Windows and Linux device drivers (firewire, pci-driver, cdrom, md, etc.) represent the first working application of shape analysis to verification of whole industrial programs.
Enabling Efficient Real Time User Modeling in On-Line Campus
Authors: Santi Caballé, Fatos Xhafa, Thanasis Daradoumis, Raul Fernandez
Venue: Proceedings of the 11th international conference on User Modeling (2007)

User modelling in on-line distance learning is an important research field focusing on two important aspects: describing and predicting students' actions and intentions as well as adapting the learning process to students' features, habits, interests, preferences, and so on. The aim is to greatly stimulate and improve the learning experience. In this context, user modeling implies a constant processing and analysis of user interaction data during long-term learning activities, which produces large and considerably complex information. As a consequence, processing this information is costly and requires computational capacity beyond that of a single computer. In order to overcome this obstacle, in this paper we show how a parallel processing approach can considerably decrease the time of processing log data that come from on-line distance educational web-based systems. The results of our study show the feasibility of using Grid middleware to speed and scale up the processing of log data and thus achieving an efficient and dynamic user modeling in on-line distance learning.
Partial goal satisfaction and goal change: weak and strong partial implication, logical properties, complexity
Authors: Yi Zhou, Leendert van der Torre, Yan Zhang
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Partial implication semantics in the context of a background theory has been introduced to formalize partial goal satisfaction in the context of beliefs. In this paper, we introduce strong partial implication prohibiting redundancies and weak partial implication allowing side effects, we study their semantic as well as complexity properties, and we apply the three notions of partial implication to goal change in the context of beliefs.
Study on Key Technologies and Software Design of BACnet Router
Authors: Quan Liu, Ping Ren
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

BACnet (Building Automation and Control networks) is a standard data communication protocol for building automation and control systems. The purpose of the BACnet network layer is to provide the means by which messages can be transmitted from one BACnet network to another regardless of the BACnet data link technology in use on that network. BACnet routers are devices that interconnect two or more BACnet networks to form a BACnet internet work and route messages between BACnet networks. In this study, the authors analyze the key technologies of BACnet router, propose a new algorithm named PRED to solve the congestion control problem of BACnet router and a software design program to put BACnet router into practice.
An Improved AdaBoost Algorithm Based on Adaptive Weight Adjusting
Authors: Lili Cheng, Jianpei Zhang, Jing Yang, Jun Ma
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

The base classifier, which is trained by AdaBoost ensemble learning algorithm, has a constant weight for all test instances. From the view of iterative process of AdaBoost, every base classifier has good classification performance in a certain small area of input space, so the constant weight for different test samples is unreasonable. An improved AdaBoost algorithm based on adaptive weight adjusting is presented. The classifiers' selection and their weights are determined by full information behavior correlation which describes the correlation between test sample and base classifier. The method makes use of all scalars of base classifier's full information behavior, overcomes the problem of information losing. The results of simulated experiments show that the ensemble classification performance is improved greatly.
Particle Filtering and Its Application in Satellite Orbit Determination
Authors: Gang Wang, Xiao-jun Duan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Focusing on nonlinear/non-Gaussian filters and based on analysis of the sampling-importance-resampling algorithm, this paper examines principles and application of particle filter (PF) in satellite orbit determination. There may be large error of initial estimation and non-Gaussian distribution of state and measurement in satellite orbit determination. To solve the two problems, an improved PF algorithm is put forward in this paper. Depending on data features, a multinomial re-sampling strategy is used for filtering and self-adaptively determines the optimal number of particles. Performance of PF under different parameters is also illustrated. Furthermore, performance of PF is compared with that of EKF and UKF in simulation experiments of satellite orbit determination. Theoretical analysis and simulation demonstrate that PF is more advantageous than EKF and UKF in operation and parameters adjusting PF in accordance with data features can promote filter speed and precision.
Measuring the Interpretive Cost in Fuzzy Logic Computations
Authors: Pascual Julián, Ginés Moreno, Jaime Penabad
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

Multi-adjoint logic programming represents an extremely flexible attempt for introducing fuzzy logic into logic programming (LP). In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in pure LP, thus returning an expression where all atoms have been exploited. This last expression is then interpreted under a given lattice during the so called interpretive phase. In declarative programming, it is usual to estimate the computational effort needed to execute a goal by simply counting the number of steps required to reach their solutions. In this paper, we show that although this method seems to be acceptable during the operational phase, it becomes inappropriate when considering the interpretive one. Moreover, we propose a more refined (interpretive) cost measure which fairly models in a much more realistic way the computational (special interpretive) a given goal.
SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
Authors: Mirosław Kurkowski, Wojciech Penczek, Andrzej Zbrzezny
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model checking. These automata correspond to executions of the participants as well as to their knowledge about letters. Given a bounded number of sessions, we can verify both correctness or incorrectness of a security protocol proving either reachability or unreachability of an undesired state. We exemplify all our notions on the Needham Schroeder Public Key Authentication Protocol (NSPK) and show experimental results for checking authentication using the verification tool VerICS.
Digraph Strong Searching: Monotonicity and Complexity
Authors: Boting Yang, Yi Cao
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

Given a digraph, suppose that some intruders hide on vertices or along edges of the digraph. We want to find the minimum number of searchers required to capture all the intruders hiding in the digraph. In this paper, we propose and study two digraph searching models: strong searching and mixed strong searching. In these two search models, searchers can move either from tail to head or from head to tail when they slide along edges, but intruders must follow the edge directions when they move along edges. We prove the monotonicity of each model respectively, and show that both searching problems are NP-complete.