16 research outputs found

    The strategic management and the possibilities of its enforcement in a particular agronomical company

    No full text
    The theoretical part focuses on the description of the development and the importance of the strategic management. The pracitcal part focuses on the analyses of the particular agricultural company called AGRO Vodňany a.s., using the methods of the strategic management. Consequently I suppose the evaluation of the possible strategies for this particular company. The last part of my dissertation focuses on the possibilities of the imrovement of the economical state of the company and as a solution I suppose the reconstruction and renovation of the pig breeding barn

    Integer programming for media streams planning problem

    Get PDF
    Abstract. Continually increasing demands for high-quality videoconferencing have brought a problem of fully automated environment setup. A media streams planning problem forms an important part of this issue. As the multimedia streams are extremely bandwidth-demanding, their transmission has to be planned with respect to available capacities of network links and the plan also needs to be optimal in terms of data transfer latencies. This paper presents an integer programming solution of the problem and its implementation. The implementation achieved very promising results in performance-evaluating measurements. Compared to previous constraint-based solver, it is capable of finding optimal solution significantly faster, allowing for real-time planning of larger problem instances.

    Formalisms and Tools for Design and Specification of Network Protocols ∗

    No full text
    Message Sequence Charts (MSC) are a useful formalism for formalization of net-work protocols early in their design phase. In this paper, we introduce the basics of MSC language and describe some of the possibilities for automatic location of "problematic " parts in the design. Focus is then given to different modifications of MSC design (FIFO behavior, bounded channels, etc.) as well as formal checking of more complex design properties (MSC membership, realizability). Next, an intro-duction of Specification and Description Language (SDL) is presented. Possibilities of automatic synthesis of system design in MSC to an SDL model and it’s correctness verification are mentioned.

    Pericardial tamponade: a rare complication of sternal bone marrow biopsy

    Get PDF
    Injury of the heart with concomitant pericardial tamponade as a result of sternal bone marrow biopsy is rare. An 80-year-old man was admitted with dehydration and non-specified abdominal pain to the regional hospital. Sternal aspiration biopsy was performed because of anemia and thrombocytopenia. Later on, because of the back pain, general weakness and blood pressure drop, an echocardiography examination was indicated. Pericardial fluid collection was found. Anticipated ascending aortic dissection was excluded on computed tomography scan, but pericardial fluid collection was confirmed. Transfer to our cardiac surgical facility ensued. Limited heart tamponade was affirmed on echocardiography and surgery was immediately indicated. Blood effusion was found in upper mediastinal fat tissue and 300 mL of blood were evacuated from opened pericardial space. Stab wound by sternal biopsy needle at the upper part of ascending aorta was repaired by pledgeted suture. Postoperative course was uneventful

    Relational Graph Attention-Based Deep Reinforcement Learning:An Application to Flexible Job Shop Scheduling with Sequence-Dependent Setup Times

    No full text
    This paper tackles a manufacturing scheduling problem using an Edge Guided Relational Graph Attention-based Deep Reinforcement Learning approach. Unlike state-of-the-art approaches, the proposed method can deal with machine flexibility and sequence dependency of the setup times in the Job Shop Scheduling Problem. Furthermore, the proposed approach is size-agnostic. We evaluated our method against standard priority dispatching rules based on data that reflect a realistic scenario, designed on the basis of a practical case study at the Dassault Systèmes company. We used an industry-strength large neighborhood search based algorithm as benchmark. The results show that the proposed method outperforms the priority dispatching rules in terms of makespan, obtaining an average makespan difference with the best tested priority dispatching rules of 4.45% and 12.52%.</p
    corecore