Enterprises' internationalisation strategy: skills in exportation and customs law

Economical development has always been connected to the commercial exchanges between people, due to the necessity to suppress their needs. With the increasing growth of international business and more competitive and demanding markets, exportation has become an important first step to internationalisation. Unlike what happened in the past, companies must be aware that the enrolment in the current global market is risky and requires elaborated technical procedures. Internationalisation should not be treated as an isolated event of business management. The first part of this paper aims to understand the export process and fit it in the current stage of international trade, keeping in mind the framework of export under the customs law. Then, we tried to understand how Portuguese companies should face this process in their internationalisation strategy, and what skills organisations must acquire to be able to export competitively in the current scenario of globalisation. The investigation was based on interviews in companies that, through a process of internationalisation by exportation, have implemented themselves strongly in extern markets. This investigation allowed us to analyse the companies’ motivations to become international, as well as the selection criteria for the export destinations. It was also possible to identify the main obstacles to the internationalisation of Portuguese companies. We concluded that companies that choose exportation as a way to become international acquire specific skills that enable them to become competitive in international trade. However, studies have failed to answer the second initial question about whether the measures implemented by Customs potentiate exports.

Short- and medium-term effects of manual therapy on cervical active range of motion and pressure pain sensitivity in latent myofascial pain of the upper trapezius muscle: a randomized controlled trial

Objective: The purpose of this study was to investigate effects of different manual techniques on cervical ranges of 17 motion and pressure pain sensitivity in subjects with latent trigger point of the upper trapezius muscle. 18 Methods: One hundred seventeen volunteers, with a unilateral latent trigger point on upper trapezius due to computer 19 work, were randomly divided into 5 groups: ischemic compression (IC) group (n = 24); passive stretching group (n = 20 23); muscle energy technique group (n = 23); and 2 control groups, wait-and-see group (n = 25) and placebo group 21 (n = 22). Cervical spine range of movement was measured using a cervical range of motion instrument as well as 22 pressure pain sensitivity by means of an algometer and a visual analog scale. Outcomes were assessed pretreatment, 23 immediately, and 24 hours after the intervention and 1 week later by a blind researcher. A 4 × 5 mixed repeated- 24 measures analysis of variance was used to examine the effects of the intervention and Cohen d coefficient was used. 25 Results: A group-by-time interaction was detected in all variables (P b .01), except contralateral rotation. The 26 immediate effect sizes of the contralateral flexion, ipsilateral rotation, and pressure pain threshold were large for 3 27 experimental groups. Nevertheless, after 24 hours and 1 week, only IC group maintained the effect size. 28 Conclusions: Manual techniques on upper trapezius with latent trigger point seemed to improve the cervical range of 29 motion and the pressure pain sensitivity. These effects persist after 1 week in the IC group. (J Manipulative Physiol 301 Ther 2013;xx:1-10)

Using a prioritized medium access control protocol for incrementally obtaining an interpolation of sensor readings

This paper addresses sensor network applications which need to obtain an accurate image of physical phenomena and do so with a high sampling rate in both time and space. We present a fast and scalable approach for obtaining an approximate representation of all sensor readings at high sampling rate for quickly reacting to critical events in a physical environment. This approach is an improvement on previous work in that after the new approach has undergone a startup phase then the new approach can use a very small sampling period.

A pseudo-medium-wide 8-competitive interface for two-level compositional real-time scheduling of constrained- deadline sporadic tasks on a uniprocessor

Compositional real-time scheduling clearly requires that ”normal” real-time scheduling challenges are addressed but challenges intrinsic to compositionality must be addressed as well, in particular: (i) how should interfaces be described? and (ii) how should numerical values be assigned to parameters constituting the interfaces? The real-time systems community has traditionally used narrow interfaces for describing a component (for example, a utilization/bandwidthlike metric and the distribution of this bandwidth in time). In this paper, we introduce the concept of competitive ratio of an interface and show that typical narrow interfaces cause poor performance for scheduling constrained-deadline sporadic tasks (competitive ratio is infinite). Therefore, we explore more expressive interfaces; in particular a class called medium-wide interfaces. For this class, we propose an interface type and show how the parameters of the interface should be selected. We also prove that this interface is 8-competitive.

WiDom: a dominance protocol for wireless medium access

In this paper, we address the problem of sharing a wireless channel among a set of sporadic message streams where a message stream issues transmission requests with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements static-priority scheduling, supports a large number of priority levels and is fully distributed. It is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But, unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. The evaluation of the protocol with real embedded computing platforms is presented to show that the proposed protocol is in fact collision-free and prioritized. We measure the response times of our implementation and show that the response-time analysis developed for the protocol offers an upper bound on the response times.

An integrated approach for TQM implementation in SMEs

This paper tackles the broad issue of TQM implementation in SMEs. It includes a review of two models aimed at improving organisational performance, the EFQM Excellence Model and the Balanced Scorecard, which have been widely used in large organisations. Both models are examined as to their suitability and applicability to small and medium sized enterprises. The findings indicate that SMEs can benefit from the adoption of an integrated approach that combines both models if some critical factors are considered in the implementation process. A theoretical framework is proposed, which considers such integration and leads to a gradual implementation of TQM principles and methods in SMEs.

Delay-bounded medium access for unidirectional wireless links

Consider a wireless network where links may be unidirectional, that is, a computer node A can broadcast a message and computer node B will receive this message but if B broadcasts then A will not receive it. Assume that messages have deadlines. We propose a medium access control (MAC) protocol which replicates a message in time with carefully selected pauses between replicas, and in this way it guarantees that for every message at least one replica of that message is transmitted without collision. The protocol ensures this with no knowledge of the network topology and it requires neither synchronized clocks nor carrier sensing capabilities. We believe this result is significant because it is the only MAC protocol that offers an upper bound on the message queuing delay for unidirectional links without relying on synchronized clocks.

Preliminary discussion on globally prioritized medium access for multi-channel wireless systems

We discuss the development of a simple globally prioritized multi-channel medium access control (MAC) protocol for wireless networks. This protocol provides “hard” pre-run-time real-time guarantees to sporadic message streams, exploits a very large fraction of the capacity of all channels for “hard” real-time traffic and also makes it possible to fully utilize the channels with non real-time traffic when hard real-time messages do not request to be transmitted. The potential of such protocols for real-time applications is discussed and a schedulability analysis is also presented.

New Shop Floor Control Approaches for Virtual Enterprises

The virtual enterprise paradigm seems a fit response to face market instability and the volatile nature of business opportunities increasing enterprise’s interest in similar forms of networked organisations. The dynamic environment of a virtual enterprise requires that partners in the consortium own reconfigurable shop floors. This paper presents new approaches to shop floor control that meet the requirements of the new industrial paradigms and argues on work re-organization at shop floor level.

Implementation of a dominance protocol for wireless medium access

Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.

Collision-free prioritized medium access in the presence of hidden nodes without relying on out-of-band signaling

Consider the problem of sharing a wireless channel between a set of computer nodes. Hidden nodes exist and there is no base station. Each computer node hosts a set of sporadic message streams where a message stream releases messages with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements staticpriority scheduling. The MAC protocol allows multiple masters and is fully distributed. It neither relies on synchronized clocks nor out-of-band signaling; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. Our protocol has the key feature of not only being prioritized and collision-free but also dealing successfully with hidden nodes. This key feature enables schedulability analysis of sporadic message streams in multihop networks.

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.

Taxonomy of broker's functions in virtual enterprises

Not just with the emergence but also with the growing of the electronic market, that is, the growth of online suppliers of services and products and Internet users (potential consumers), the necessary conditions to the affirmation of the agile/virtual enterprises (A/VE) as a present and future enterprise organizational model are created. In this context, it is our understanding that the broker may have an important role in its development, namely, if the broker performs functions for the A/VE with better efficacy and efficiency. In this article, we will present first a revision of the broker’s models in a structured form. We present a taxonomy of possible broker’s functions for the broker’s actuation near the A/VE and then the classification of the literature broker’s models. This classification will permit an analysis of a broker’s model and establish a mainframe for our broker’s model according to the BM_Virtual Enterprise Architecture Reference Model (BM_VEARM).

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

El conservadurismo, el secreto y las opciones de financiación de las pyme portuguesas

Doutoramento em Economia Financeira e Contabilidade