期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
关于网箱投饵装置分组集成控制的研究与分析
1
作者 朱成俊 李成思 《科技创新与应用》 2017年第31期195-196,共2页
网箱养殖具有集约化、高密度、高效益等特点,是我国渔业产业的主力军,但目前网箱养殖的投饵装置存在输电难,安全性低等问题。本研究以投饵装置为研究对象,采用独特的控制策略配合分组集成的控制方式有效解决了输电中压降和高电流的关键... 网箱养殖具有集约化、高密度、高效益等特点,是我国渔业产业的主力军,但目前网箱养殖的投饵装置存在输电难,安全性低等问题。本研究以投饵装置为研究对象,采用独特的控制策略配合分组集成的控制方式有效解决了输电中压降和高电流的关键性难题,有效降低了人工成本,大大提高了投饵设备的安全性。 展开更多
关键词 网箱 投饵装置 分组集成 逻辑控制
下载PDF
J2EE-BASED DISTRIBUTED AND INTEGRATABLE MANUFACTURING EXECUTION SYSTEM 被引量:2
2
作者 杨浩 朱剑英 周娜 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2004年第3期213-219,共7页
Using the Java 2 enterprise edition (J2EE), the industry standard technique, a component and web-based manufacturing execution system (MES), is presented. It is considered to be open, modularized, distributed, configu... Using the Java 2 enterprise edition (J2EE), the industry standard technique, a component and web-based manufacturing execution system (MES), is presented. It is considered to be open, modularized, distributed, configurable, interoperable and maintainable. After introducing some core techniques of J2EE as the basic foundations of the proposed MES, this paper briefly analyzes the MES domain in manufacturing systems and constructs the abstract object and component model, and then establishes the MES architecture. This MES can be facilely integrated with other manufacturing applications. Finally, an example of integration with the enterprise resource planning (ERP) system is given. 展开更多
关键词 MES J2EE ERP INTEGRATION component-based system
下载PDF
Homegardens as a Source of Income for Rural Households A Case Study of Bieha District, Southern Burkina Faso
3
作者 Reginald Tang Guuroh Holm Uibrig Emmanuel Acheampong 《Journal of Agricultural Science and Technology(B)》 2012年第7期798-813,共16页
This exploratory research studied the contribution of homegardens to household income generation. In Burkina Faso, the Bieha department was purposively selected. The initial rapid rural appraisal was complemented by a... This exploratory research studied the contribution of homegardens to household income generation. In Burkina Faso, the Bieha department was purposively selected. The initial rapid rural appraisal was complemented by a household survey. Tools of data collection included observation, key informant interview, and focus group discussion. For the survey, eighty households were selected based on systematic sampling. Data was collected by individual interviews at household level, and for statistical calculations, the households were subsequently categorized as small, medium and commercial based on their homegarden size. It was found that all the surveyed households managed homegardens composed of trees, crops and animals. Majority of the farmers (43%) belonged to the small category due to land constraints. Generally, farms contributed more income than the plant component of homegardens. However, when the livestock component of homegardens was added, homegardens became far more important than farms and accounted for over 60% of income generation for all categories. It can be concluded that homegardens are important to rural people for food and cash income. 展开更多
关键词 AGROFORESTRY land fragmentation population growth livelihood.
下载PDF
On Total Domination Polynomials of Certain Graphs
4
作者 S. Sanal H. E. Vatsalya 《Journal of Mathematics and System Science》 2016年第3期123-127,共5页
We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt(G, x) = ∑in=yt(G) dr(G, i) x', where dr(G, i) is the cardinality of total dominating sets of... We have introduced the total domination polynomial for any simple non isolated graph G in [7] and is defined by Dt(G, x) = ∑in=yt(G) dr(G, i) x', where dr(G, i) is the cardinality of total dominating sets of G of size i, and yt(G) is the total domination number of G. In [7] We have obtained some properties of Dt(G, x) and its coefficients. Also, we have calculated the total domination polynomials of complete graph, complete bipartite graph, join of two graphs and a graph consisting of disjoint components. In this paper, we presented for any two isomorphic graphs the total domination polynomials are same, but the converse is not true. Also, we proved that for any n vertex transitive graph of order n and for any v ∈ V(G), dt(G, i) = 7 dt(V)(G, i), 1 〈 i 〈 n. And, for any k-regular graph of order n, dr(G, i) = (7), i 〉 n-k and d,(G, n-k) = (kn) - n. We have calculated the total domination polynomial of Petersen graph D,(P, x) = 10X4 + 72x5 + 140x6 + 110x7 + 45x8 + [ 0x9 + x10. Also, for any two vertices u and v of a k-regular graph Hwith N(u) ≠ N(v) and if Dr(G, x) = Dt( H, x ), then G is also a k-regular graph. 展开更多
关键词 total dominating set total domination number total domination polynomial
下载PDF
Competitiveness of Travel Agencies in the European Tourism Market
5
作者 Iris Mihajlovic 《Chinese Business Review》 2013年第4期278-286,共9页
The concept of competitiveness influenced by many factors is analyzed in terms of terminology distinctions. This is the reason of numerous definitions of this term included in the first part of the paper, which varies... The concept of competitiveness influenced by many factors is analyzed in terms of terminology distinctions. This is the reason of numerous definitions of this term included in the first part of the paper, which varies according to the aspect of the analysis, analyzed marketing unit, tourism product, geographical unit, region, destination, or entities that offer an acceptable integrated product a package by specific indicators for comparison of elements of competitiveness. The first part of the article theoretically emphasizes the distinction in defining the concept of competitiveness from various aspects of the analyzed market subjects (different features and facilities provided), and from those aspects of their specific business relationship in the market. Special contribution to the study of competitiveness is contained in the second part of the paper that analyzes the existing situation of intermediation in the European tourism market. This research is based on using the data of descriptive statistics and the secondary research which gives insights into the business of travel agencies, using the data such as number of employees, annual personnel costs, and the average annual cost per person employed in travel agencies in some European countries. The changes in the environment, and the competition initiate a need for an analysis of the internal environment, travel agencies' tasks, and their organizational structure. Also, the results conducted research on a sample of 500 travel agencies in 20 European countries indicate the dominance of quality service, price, and value for money as key factors of demand for achieving the competitiveness. It indicates new trends focused on needs for more specific--integrated tourist products that ensure the quality of service, value for money, and for the time that tourists invest in their obtaining. 展开更多
关键词 dynamic environment INTERMEDIARIES COMPETITION MARKET service quality PRICE
下载PDF
Super s-restricted edge-connectivity of vertex-transitive graphs
6
作者 SUN WuYang ZHANG HePing 《Science China Mathematics》 SCIE 2014年第9期1883-1890,共8页
Let G be a connected graph with vertex-set V(G)and edge-set E(G).A subset F of E(G)is an s-restricted edge-cut of G if G-F is disconnected and every component of G-F has at least s vertices.Letλs(G)be the minimum siz... Let G be a connected graph with vertex-set V(G)and edge-set E(G).A subset F of E(G)is an s-restricted edge-cut of G if G-F is disconnected and every component of G-F has at least s vertices.Letλs(G)be the minimum size of all s-restricted edge-cuts of G andξs(G)=min{|[X,V(G)\X]|:|X|=s,G[X]is connected},where[X,V(G)\X]is the set of edges with exactly one end in X.A graph G with an s-restricted edge-cut is called super s-restricted edge-connected,in short super-λs,ifλs(G)=ξs(G)and every minimum s-restricted edge-cut of G isolates one component G[X]with|X|=s.It is proved in this paper that a connected vertex-transitive graph G with degree k>5 and girth g>5 is super-λs for any positive integer s with s 2g or s 10 if k=g=6. 展开更多
关键词 vertex-transitive graph restricted edge-connectivity s-restricted edge-connectivity super-λs graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部