436 research outputs found
Vállalkozó hallgatók-Valóban reális jövőkép a vállalkozóvá válás? (Entrepreneurial students – Really realistic vision of becoming an entrepreneur?)
A tanulmány az egyetemi hallgatĂłk, mint a jövĹ‘ potenciális tudásintenzĂv vállalkozĂłinak sajátosságát hivatott
vizsgálni, empirikus úton. A kutatás feltáró jellegű, hiszen igen keveset tudni általában az egyetemi
hallgatĂłk, Ă©s kĂĽlönösen a Szegedi Tudományegyetem egyetemi hallgatĂłinak vállalatalapĂtási motiváciĂłrĂłl,
aktivitásáról és az egyetem ezzel kapcsolatos szerepéről. A vizsgálatok két fő cél köré összpontosulnak: a
Szegedi Tudományegyetem nappali tagozatos hallgatĂłinak vállalatalapĂtási aktivitását feltárni, valamint
a vállalatindĂtáshoz szĂĽksĂ©ges ismereteket feltĂ©rkĂ©pezni. A tanulmány elsĹ‘ rĂ©szĂ©ben a szerzĹ‘k a kĂ©rdĹ‘Ăves
megkĂ©rdezĂ©s eredmĂ©nyeit ismertetik, mely keretĂ©ben 840 fĹ‘t kĂ©rdeztek meg a hallgatĂłi vállalkozásalapĂtási
aktivitás feltárása Ă©rdekĂ©ben. Ezt követĹ‘en hĂşsz, már hallgatĂł korában vállalkozást alapĂtĂł szemĂ©llyel törtĂ©nĹ‘
mĂ©lyinterjĂşk eredmĂ©nyeit mutatják be, kĂĽlönös tekintettel arra, milyen specialitásokkal bĂrnak azon
vállalkozĂłk, akik már hallgatĂłkĂ©nt belevágtak egy vállalkozás elindĂtásába. _______ Present paper provides an empirical analysis of the characteristics
of university students as potential knowledgeintensive
entrepreneurs of the future. The authors’ research
is explorative since the knowledge of university
students and especially of the students of the University
of Szeged is scarce with regard to their entrepreneurial
motivations, activities and the influence of the university.
The authors set two fundamental objectives: first,
to explore the entrepreneurial activities of the full-time
students of the University of Szeged; and second, to map
the knowledge necessary for starting a business. In the
first part of the paper they demonstrate the results of an
empirical survey based on 840 questionnaires that aimed
at the exploration of students’ entrepreneurial activities
Gyártási rendszerek szintézise és ütemezése = Process Network and Scheduling
A kutatásaink során a gyártási rendszerek ĂĽtemezĂ©sĂ©nĂ©l, szervezĂ©sĂ©nĂ©l felmerĂĽlĹ‘ optimalizálási problĂ©mákat vizsgáltuk. Ebben a tĂ©makörben a TSP feladat kĂĽlönbözĹ‘ változataira alkalmaztuk az összefűzĂ©si technika mĂłdszerĂ©t. Továbbá három további problĂ©mára (belsĹ‘ szállĂtások elemzĂ©se körutakban, karbantartási feladatok vĂ©grehajtása, vĂ©grehajtási idĹ‘k hálĂłzati folyamatokban) definiáltunk matematikai modelleket, Ă©s ezen modellek megoldására kĂĽlönbözĹ‘ heurisztikus megoldĂł algoritmusokat fejlesztettĂĽnk ki. A másik feladatcsoport, amit vizsgáltunk a szĂ©les körben elterjedt PNS optimalizálási feladat további elemzĂ©se, illetve a modell további lehetsĂ©ges alkalmazásainak kifejlesztĂ©se volt. Ebben a tĂ©makörben három Ăşj alkalmazást ismertettĂĽnk: Megadtunk egy modellt, ahol a folyamatok esetleges környezetszennyezĹ‘ hatását is figyelembe vesszĂĽk. Megmutattuk, hogy a PNS model egy kiterjesztĂ©sĂ©t jĂłl lehet használni a workflow problĂ©ma modellezĂ©sĂ©nek a terĂĽletĂ©n is lehet használni. Megmutattuk, hogy alkalmas bizonyos gyártási folyamatok esetĂ©n a határidĹ‘k kezelĂ©sĂ©re, a vállalási idĹ‘k meghatározására. A PNS problĂ©ma vizsgálatát is folytattuk. LeĂrtuk a szĂ©tválasztĂł hálĂłzatok Ă©s az automatákkal felismerhetĹ‘ nyelvek kapcsolatát, Ă©s ezáltal egy Ăşj megoldĂł algoritmust dolgoztunk ki. A nemlineáris modellre is megadtunk egy Ăşj megoldĂł algoritmust, továbbá a kombinatorikus PNS modell esetĂ©n egy Ăşj redukciĂłs algoritmust fejlesztettĂĽnk ki. | We investigated the optimization problems which appear during scheduling and organizing process networks. We presented the applications of the patching technique for different versions of the TSP problem. We defined mathematical models for three further problems (internal transports in TSP, scheduling in service, scheduling in process network synthesis) and we developed heuristic algorithms for these models. We investigated further the well-known PNS optimization problem. We presented three new applications: we extended the model to handle pollution minimization, we showed an extension which works for work-flow problems, and we presented an application when the PNS model can be used to determine due dates. We also achieved some results for the original PNS problem. We described the separation networks by formal languages which can be recognized by automata, and we used that to develop a new algorithm. We developed a new algorithm for the nonlinear model, furthermore we developed a new reduction algorithm for the combinatorial PNS model
Online erőforrás allokációs problémák = Online resource allocation problems
JellemzĹ‘ problĂ©ma, hogy korlátozott mennyisĂ©gű erĹ‘forrást kell szĂ©tosztani a felmerĂĽlĹ‘ igĂ©nyek között. Számos esetben a problĂ©ma online, azaz a problĂ©ma inputját csak rĂ©szenkĂ©nt ismerjĂĽk meg Ă©s döntĂ©seinket a már megkapott informáciĂłk alapján a további adatok ismerete nĂ©lkĂĽl kell meghoznunk. A kutatásaink során ilyen, online erĹ‘forrás allokáciĂłs problĂ©mákkal foglalkoztunk az alábbi rĂ©szterĂĽleteken. Az ĂĽtemezĂ©s elmĂ©letĂ©ben olyan problĂ©mákat vizsgáltunk, amelyekben az ĂĽtemezĂ©sen kĂvĂĽl más döntĂ©seket is meg kell hozni az algoritmusnak, speciálisan a gĂ©pköltsĂ©ges (a gĂ©pek száma nem adott paramĂ©ter, hanem meg kell Ĺ‘ket vásárolni) Ă©s visszautasĂthatĂł munkák modelljeit tanulmányoztuk. Ládapakolás Ă©s ládafedĂ©s esetĂ©n azon modelleket vizsgáltuk, amelyekben a ládák tartalmára a megkövetelt összsĂşlyon kĂvĂĽl további korlát is adott (pl a ládában szereplĹ‘ elemek számára, vagy az elemek fajtáinak számára). Egy további modellt is vizsgáltunk, ahol a ládák száma adott Ă©s a cĂ©l a minimális összsĂşllyal lefedni az összes ládát. A nyugtázási problĂ©ma során elĹ‘renĂ©zĹ‘ algoritmusokat vizsgáltunk, amelyek csak fĂ©lig online algoritmusok, mert a döntĂ©s idĹ‘pontjában az input egy további rĂ©szĂ©rĹ‘l (de nem az egĂ©szrĹ‘l) is rendelkeznek informáciĂłval. A vizsgált modellek megoldására Ăşj algoritmusokat fejlesztettĂĽnk ki, azokat a versenykĂ©pessĂ©gi elemzĂ©s alapján megvizsgáltuk. NĂ©hány esetben, ahol a versenykĂ©pessĂ©gi elemzĂ©s nem volt releváns empirikus elemzĂ©st hajtottunk vĂ©gre. | In optimization problems it often happens that we have to allocate some bounded resources. In some cases these problems are online, which means that we receive the input part by part, and we have to make the decision without any information about the further parts. In the project we analysed such problems. In scheduling the we considered the problem of scheduling with machine cost (the number of machines is not part of the input, we have to buy it) and scheduling where the jobs can be rejected. In bin packing and covering we considered the problems where extra condition is given for the bins (the number of items, or the number of items of different types). Furthermore we investigated a model, where the number of bins is given, and the goal is to minimize the total size of items which cover them. In data acknowledgment we considered the time lookahead version, where the algorithm has some partial extra information about the further part of the input. In each model we developed new algorithms and analysed them by competitive analysis. In some cases where competitive analysis was not useful we used empirical analysis
On directable nondeterministic trapped automata
A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways. In [8], three such notions, D1-, D2-, and D3-directability, are introduced. In this paper, we introduce the trapped n.d. automata, and for each i = 1,2,3, present lower and upper bounds for the lengths of the shortest Di-directing words of n-state Di-directable trapped n.d. automata. It turns out that for this special class of n.d. automata, better bounds can be found than for the general case, and some of the obtained bounds are sharp
Increasing Regional Embeddedness of the ELI-ALPS Laser Research Centre in the Szeged Region: Opportunities of the University-based Enterprise Development
An online scheduling algorithm for a two-layer multiprocessor architecture
In this paper we give online algorithms and competitive ratio bounds for a scheduling problem on the following two-layer architecture. The architecture consists of two sets of processors; within each set the processors are identical while both the processors themselves and their numbers may differ between the sets. The scheduler has to make an online assigment of jobs to one of the two processor sets. Jobs, assigned to a processor set, are then sceduled in an optimal offline preemptive way within the processor set considered. The scheduler's task is to minimize the maximum of the two makespans of the processor sets
VENTURE CAPITAL AND THE INCUBATION OF SMALL ENTERPRISES
The present paper has reviewed the potential interpretations of the incubation process and examined in detail the basic types of corporate incubators having an increasing role in everyday practice together with the main objectives of the different types. We have also mapped how the different types of enterprises can join the incubation process and highlighted that for-profit organisations can also play a significant role within financing solutions. We made an attempt to prove that – under adequate conditions – the cooperation of private capital and incubators is suitable for creating a bridge over the equity and knowledge gap, which means that such co-operations can also have significant economic development effects. Incubators operating on such bases can support small and medium-sized enterprises not only by offering financial and professional help. Experience has shown that the incubation process can be "naturally accompanied†by the initiation of a networking process, the advantages of which can also be used by the companies participating in incubation. After examining the special features related to the operation of corporate incubators –which served to set the logical frames of the analysis – we studied in detail what role the state can assume in such type of incubation. Following some theoretical considerations and an analysis of successful and failed practical examples we reached the conclusion that governmental interventions „can have their place†in this process. Since there are various different ways for the development of incubators, the types of roles taken by the state can also differ. A model was developed in which we summarized potential governmental strategies, also discussing the possible effects on the players of the incubation industry. We are convinced that the analysis of this highly new and dynamically developing area may also lead to conclusions that can be applied in practice and the recognition of defined rules and laws may contribute to the improvement of the national practice.business incubation, corporate business incubation, knowledge and capital gap, V2C (venture to capital), Community/Rural/Urban Development, Financial Economics,
Automaton theory approach for solving modified PNS problems
In this paper a modified version of the Process Network Synthesis (PNS) problem is studied. By using an automaton theoretical approach, a procedure for finding an optimal solution of this modified PNS problem is presented
- …