A new framework for sharp and efficient resolution of NCSP with manifolds of solutions

When numerical CSPs are used to solve systems of n equations with n variables, the preconditioned interval Newton operator plays two key roles: First it allows handling the n equations as a global constraint, hence achieving a powerful contraction. Second it can prove rigorously the existence of solutions. However, none of these advantages can be used for under-constrained systems of equations, which have manifolds of solutions. A new framework is proposed in this paper to extend the advantages of the preconditioned interval Newton to under-constrained systems of equations. This is achieved simply by allowing domains of the NCSP to be parallelepipeds, which generalize the boxes usually used as domains.     

A new test scheduling algorithm based on Networks-on-Chip as Test Access Mechanisms

Networks-on-Chip (NoCs) can be used for test data transportation during manufacturing tests. On one hand, NoC can avoid dedicated Test Access Mechanisms (TAMs), reducing long global wires, and potentially simplifying the layout. On the other hand, (a) it is not known how much wiring is saved by reusing NoCs as TAMs, (b) the impact of reuse-based approaches on test time is not clear, and (c) a computer aided test tool must be able to support different types of NoC designs. This paper presents a test environment where the designer can quickly evaluate wiring and test time for different test architectures. Moreover, this paper presents a new test scheduling algorithm for NoC TAMs which does not require any NoC timing detail and it can easily model NoCs of different topologies. The experimental results evaluate the proposed algorithm for NoC TAMs with an exiting algorithm for dedicated TAMs. The results demonstrate that, on average, 24% (up to 58%) of the total global wires can be eliminated if dedicated TAMs are not used. Considering the reduced amount of dedicated test resources with NoC TAM, the test time of NoC TAM is only, on average, 3.88% longer compared to dedicated TAMs.     

Insights from a simple expression for linear fisher information in a recurrently connected population of spiking neurons

A simple expression for a lower bound of Fisher information is derived for a network of recurrently connected spiking neurons that have been driven to a noise-perturbed steady state. We call this lower bound linear Fisher information, as it corresponds to the Fisher information that can be recovered by a locally optimal linear estimator. Unlike recent similar calculations, the approach used here includes the effects of nonlinear gain functions and correlated input noise and yields a surprisingly simple and intuitive expression that offers substantial insight into the sources of information degradation across successive layers of a neural network. Here, this expression is used to (1) compute the optimal (i.e., information-maximizing) firing rate of a neuron, (2) demonstrate why sharpening tuning curves by either thresholding or the action of recurrent connectivity is generally a bad idea, (3) show how a single cortical expansion is sufficient to instantiate a redundant population code that can propagate across multiple cortical layers with minimal information loss, and (4) show that optimal recurrent connectivity strongly depends on the covariance structure of the inputs to the network.     

Generating asynchronous test cases from test purposes

Context

Input/output transition system (IOTS) models are commonly used when next input can arrive even before outputs are produced. The interaction between the tester and an implementation under test (IUT) is usually assumed to be synchronous. However, as the IUT can produce outputs at any moment, the tester should be prepared to accept all outputs from the IUT, or else be able to block (refuse) outputs of the implementation. Testing distributed, remote applications under the assumptions that communication is synchronous and actions can be blocked is unrealistic, since synchronous communication for such applications can only be achieved if special protocols are used. In this context, asynchronous tests can be more appropriate, reflecting the underlying test architecture which includes queues.

Objective

In this paper, we investigate the problem of constructing test cases for given test purposes and specification input/output transition systems, when the communication between the tester and the implementation under test is assumed to be asynchronous, performed via multiple queues.

Method

When issuing verdicts, asynchronous tests should take into account a distortion caused by the queues in the observed interactions. First, we investigate how the test purpose can be transformed to account for this distortion when there are a single input queue and a single output queue. Then, we consider a more general problem, when there may be multiple queues.

Results

We propose an algorithm which constructs a sound test case, by transforming the test purpose prior to composing it with the specification without queues.

Conclusion

The proposed algorithm mitigates the state explosion problem which usually occurs when queues are directly involved in the composition. Experimental results confirm the resulting state space reduction.     

Reliability and validity of an ergonomics-related Job Factors Questionnaire

Musculoskeletal disorders are an important cause of work disability and absenteeism. Specific job factors or tasks may increase the likelihood of developing work-related musculoskeletal disorders. The purpose of the present study was to translate and adapt a Job Factors Questionnaire for the Brazilian–Portuguese language and evaluate its psychometric properties. A cross-cultural adaptation was performed according to an internationally recommended methodology involving translation, synthesis, back-translation, revision by an expert committee, and pre-testing. The psychometric properties were evaluated by administering the questionnaire to 148 employees at two companies involved in the assembly and fabrication of metal products. The reliability of the questionnaire was assessed by measuring the temporal stability through a test–retest design. Construct validity was assessed using the known-groups technique and by comparing workers responses with findings from the Nordic Questionnaire. Reliability was determined to be satisfactory based on Intraclass Correlation Coefficients ranging from 0.54 to 0.73. Construct validity analysis demonstrated a significant difference (p ≤ 0.02) between production and office workers on answers to 10 questionnaire items, and a significant difference (p ≤ 0.01) on the scores of the adapted questionnaire between subjects that indicated presence or absence of musculoskeletal symptoms. The results indicated that the adapted version of the questionnaire had psychometric properties that were acceptable for use in occupational studies involving workers that speak Brazilian–Portuguese.

Relevance to industry

The present study provides results of a cross-cultural adaptation process and a psychometric properties analysis of an instrument that verifies workers' perception of job factors that may lead to work-related pain and discomfort.     

Aerodynamic and aeroelastic analyses on the CAARC standard tall building model using numerical simulation

The simulation of the wind action over the CAARC (Commonwealth Advisory Aeronautical Council) standard tall building model is performed in the present work. Aerodynamic and aeroelastic analyses are reproduced numerically in order to demonstrate the applicability of CFD techniques in the field of wind engineering. A major topic in this paper is referred to one of the first attempts to simulate the aeroelastic behavior of a tall building employing complex CFD techniques. Numerical results obtained in this work are compared with numerical and wind tunnel measurements and some important concluding remarks about the present simulation are also reported.     

A computational model for developing semantic web-based educational systems

Recently, some initiatives to start the so-called semantic web-based educational systems (SWBES) have emerged in the field of artificial intelligence in education (AIED). The main idea is to incorporate semantic web resources to the design of AIED systems aiming to update their architectures to provide more adaptability, robustness and richer learning environments. However, the construction of such systems is highly complex and faces several challenges in terms of software engineering and artificial intelligence aspects. This paper presents a computational model for developing SWBES focusing on the problem of how to make the development easier and more useful for both developers and authors. In order to illustrate the features of the proposed model, a case study is presented. Furthermore, a discussion about the results regarding the computational model construction is available.     

Computing the Duquenne–Guigues basis: an algorithm for choosing the order

This paper presents an algorithm for choosing the order in which pseudo-intents are enumerated when computing the Duquenne–Guigues basis of a formal context. Sets are constructed through the use of a spanning tree to ensure they are all found once. The time and space complexities of the algorithm are empirically evaluated using, respectively, the number of logical closures and the number of sets in memory as measures. It is found that only the space complexity depends on the enumeration order.