民间招幌文化对现代广告设计的启示借鉴

传统民间招幌是古代商业中的重要组成部分,蕴含着丰厚的民间美术文化,对传统招幌的样式及种类进行分析,可以为现代广告设计提供新的设计思路,从传统民间招幌中汲取元素的同时提高现代设计的文化内涵.     

洛阳历史街区商业招牌形象的改善设计研究

目的 梳理出商业招牌与历史街区之间的关系,明确商业招牌形象改善的重要性;构建历史街区商业招牌的改善设计理论,为历史街区商业招牌形象的改善设计提供参考.方法 将视觉设计、环境设计、信息设计等理念交叉融合导入招牌形象设计中,构筑招牌设计的基本要求;以商业招牌的各视觉要素为研究对象,通过相关的设计法则、法律规定、案例分析,总结出各要素的设计准则;以洛阳历史街区为例,通过现场调研与问卷调查的方法对商业招牌现存的问题与改善方案进行讨论;通过改善实例对理论架构进行论证,并总结出历史街区商业招牌形象设计的原则.结论 商业招牌形象的改善要结合街区环境、商铺特征、受众审美3个层面,符合功能、审美、场所、创意、景观5个特性,通过对各要素的设计进行展现.     

传统招幌与现代商业视觉设计

传统招幌是中国商业民俗的组成部分,也是民族传统视觉艺术的独特样式.传统招幌随着市井社会与商品经济的发展而不断发展演变,它具有的鲜明民族特色、浓郁文化韵味和独特表现方式,对于现代商业性的视觉艺术设计,具有重要的参考价值和启示意义.     

中德历史街区店招设计比较及对策研究——以林道市(lindau)和杭州市为例

历史街区中的店招设计,不仅仅是商家的宣传窗口,更是街区的历史文化载体。本文首先对德国旅游城市林道市历史街区店招设计的历史背景、图形设计及制作工艺、与文化遗产保护的融合几个方面进行分析,总结德国在该方面的特点及经验;进而对杭州历史街区店招设计的概况、图形设计、工艺形式等方面解读,肯定其特色的同时也点明了杭州历史街区店招设计中的不足;最后,结合德国经验从文化提升、与历史街区建筑环境的协调性、工艺的适用性、健全法律法规等方面,提出了杭州历史街区店招设计的对策和建议。     

基于“五感”体验的景观设计探析——以南京老门东历史街区更新改造为例

通过对景观设计中由视觉、听觉、触觉、嗅觉、味觉构成的“五感”体验进行分析,并对“五感”体验介入历史文化街区改造的相关设计进行分析整理,以南京老门东历史文化街区为例进行具体分析,提炼其设计理念,从5个方面分析“五感”体验介入历史文化街区改造的表现形式,为其他相关设计提供借鉴。     

统一店招背景、问题与对策研究——以芜湖为例

引言 "千里莺啼绿映红,水村山郭酒旗风",诗中描写的酒旗就是挂在酒家门口的店招,我国的店招历史最早可追溯到东周时期,当时店招的主要功能是为了招揽顾客,而店招发展至今,店招已然成为户外广告的一种重要广告形式,是商户对外宣传的窗口与标志,也是街区的历史文化载体,城市历史文化风貌的展现.近些年来,上海、南京以及芜湖等地出现了统一店招的现象,引起了社会的关注,以下即对统一店招的利弊进行分析,并提出一些建议,期望能为"统一店招"问题带来一些帮助.     

城市针灸视角下历史街区保护与更新的思考

城市化进程中,城市的发展与扩张伴随着经济重心转移与人口结构变化,导致部分或较多历史街区因诸多原因日渐衰落,造成了本土文脉的式微以及文化财富的流失。文章以探索历史街区保护与更新方式为目的,在城市针灸理念的视角下,以现阶段中国历史街区现状为基,思考历史街区的保护与更新方式,将城市消极空间视为病源、历史街道视为穴位,以城市针灸为治疗方法,结合实际案例分析如何以"微创式""渐进式"的城市针灸理念,疏通文化血脉,活化消极空间,达到保护街道生态与肌理、提升街道活力及重构邻里关系的效果,从而对历史街区的保护与更新工作从文态、形态、业态上如何进展发起讨论,以期为历史街区的保护与更新提供新的思路。     

天津五大道文化旅游街区视觉符号在公共设施设计中的应用研究

目的通过文字、形象和颜色三个方面,提取天津五大道历史文化旅游街区的视觉符号,探索视觉符号运用在旅游街区公共设施中的价值,为解决现阶段各个城市历史街区公共设施个性缺失的问题提供技术路径和设计案例。方法通过对五大道文化旅游街区的历史追溯,从文字提取、形象提取和色彩提取三个方面入手,总结出视觉符号的提取方法和设计思路。分析视觉符号在公共设施设计中的应用价值,运用视觉符号植入的方法,从服务、信息、卫生和照明四个具有代表性的公共设施入手,对五大道历史文化街区公共设施进行重新设计。结论各个城市历史文化街区具有本地深厚的积淀和传承,在街区更新中,把具有地域性特点的视觉符号应用在公共设施的设计中,能够更好地传递城市的精神文化,塑造更具识别性的城市形象。     

浅析历史街区改造项目特点及现行设计标准对其影响与制约

近年来经济的飞速发展给城市带来了巨大变革,与此同时城市化进程也为经济的发展提供了强大动力。在城市化进程中,历史街区的保护和改造是城市更新的重点所在,它们有着不同于其他新建项目的特点,在设计与实施的过程中,现行设计标准对其进行着制约。本文将从历史街区改造的特点出发分析其特殊性,进而引出现行设计标准对项目的制约,并通过案例分析探索如何在这些制约中获得平衡。     

江南传统园林意象在数字艺术装置设计中的应用研究

通过总结公共艺术装置数字化的拓展方式,将艺术装置的设计与江南传统园林意象相结合,以期为城市中艺术装置的展陈与应用注入新的生机与活力。以苏州平江路历史街区作为设计背景,从空间构想、内容设计、多媒体设计三个角度入手,通过对“数字艺术装置”的设计应用,将传统文化、现代技术和艺术装置的创意结合,为拓展城市艺术装置的体验性提供更多技术路径。以江南传统园林意象作为设计符号的切入点,地域性的历史街区为背景,尝试探索一种新的理念和形式,用数字化的方式重新解构传统文化的符号表达,力求为历史旅游街区、文化遗产保护、地域传统文化输出起到抛砖引玉的作用。     

An evaluation of worker cross training and flexible workdays in job shops

Capacity flexibility is becoming increasingly important as a means for reducing inventory while maintaining customer service levels. We examine two means to increase capacity flexibility. In particular, we examine an environment where both cross training and flexible workdays are available to respond to workload variability. Flexible workdays are under consideration in the US Legislature. This proposed legislation provides the opportunity for workers to exchange overtime for time off. From a managerial perspective, flexible workdays allow management to shift capacity from periods of light load to periods of heavy load. We simulate the operation of a job shop with both cross training and flexible workdays. Our results indicate that cross training is a far more effective tool for improving performance as compared to flexible workdays. Flexible workdays can be valuable particularly in volatile conditions. However, our results indicate that the degree of cross training is a critical consideration in determining the impact of flexible workdays.     

Permutation flow shops with exact time lags to minimise maximum lateness

In this paper we investigate the m-machine permutation flow shop scheduling problem where exact time lags are defined between consecutive operations of every job. This generic model can be used for the study and analysis of various real situations that may arise, for instance, in the food-producing, pharmaceutical and steel industries. The objective is to minimise the maximum lateness. We study polynomial special cases and provide a dominance relation. We derive lower and upper bounds that are integrated in a branch-and-bound procedure to solve the problem. Three branching schemes are proposed and compared. We perform a computational analysis to evaluate the efficiency of the developed method.     

The performance of Due Date setting rules in assembly and multi-stage job shops: an assessment by simulation

Setting short yet reliable Due Dates (DDs) is an important early production planning and control task. The majority of job-shop research on DD setting assumes simple product structures without assembly operations. However, in practice, product structures are often complex, and multiple final assembly operations may be required. This paper evaluates the performance of DD setting rules in the context of complex product structures, considering two scenarios: two-level assembly job shops, where orders converge on one final assembly operation; and two-level multi-stage job shops, where a series of assembly operations are undertaken. New rules are proposed which are substantially simpler and more suitable for practical use than those in the literature. These rules are only outperformed by a more sophisticated rule from the wider literature, newly introduced into the context of assembly and multi-stage job shops. Which rule to apply in practice depends on whether a manager considers the improvement in performance more important than the loss of simplicity. Future research should investigate how jobs can be planned and controlled effectively when some or all DDs are set externally by customers rather than internally using a DD setting rule.     

A first introduction of customer-driven capacity exchange for job shops

With demand variability and unpredictability, decreasing product life cycles, globalisation and increasing competition, rush orders are increasingly being received at job shops. However, these rush orders can be difficult to fulfil owing to a lack of capacity during boom and heavy workload periods. In this situation, a feasible solution is capacity exchange, through which capacity is transacted and exchanged with other customers for whom the manufacturer has already reserved capacity. Accordingly, this study develops a customer-driven capacity exchange mechanism for solving the foregoing problem of temporary capacity shortage caused by the receipt of rush orders in a job shop. Notably, this innovative concept and mechanism can be expected to concurrently benefit capacity holders, capacity demanders and manufacturers. Additionally, this study presents a comprehensive design scheme, working scenario, and possible implementation for a capacity exchange mechanism.     

Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach

There are many dynamic events like new order arrivals, machine breakdowns, changes in due dates, order cancellations, arrival of urgent orders etc. that makes static scheduling approaches very difficult. A dynamic scheduling strategy should be adopted under such production circumstances. In the present study an event driven dynamic job shop scheduling mechanism under machine capacity constraints is proposed. The proposed method makes use of the greedy randomised adaptive search procedure (GRASP) by also taking into account orders due dates and sequence-dependent set-up times. Moreover, order acceptance/rejection decision and Order Review Release mechanism are integrated with scheduling decision in order to meet customer due date requirements while attempting to execute capacity adjustments. We employed a goal programming-based logic which is used to evaluate four objectives: mean tardiness, schedule unstability, makespan and mean flow time. Benchmark problems including number of orders, number of machines and different dynamic events are generated. In addition to event-driven rescheduling strategy, a periodic rescheduling strategy is also devised and both strategies are compared for different problems. Experimental studies are performed to evaluate effectiveness of the proposed method. Obtained results have proved that the proposed method is a feasible approach for rescheduling problems under dynamic environments.     

Workload control in dual-resource constrained high-variety shops: an assessment by simulation

Workload Control (WLC) seeks to align capacity with demand, where capacity is typically assumed to be restricted by a single constraint – machine capacity. In practice, however, shops are often restricted by dual resource constraints: labour and machines. This study, therefore, uses simulation to investigate the performance of WLC in Dual Resource Constrained (DRC) high-variety shops with fully interchangeable labour. By considering several environmental factors and different labour assignment and dispatching rules, it is demonstrated that the order release function of WLC maintains its positive impact on performance in a DRC shop under different staffing levels. The positive effect of considering labour availability at release, as proposed in previous research, could not, however, be confirmed. Thus, the original release method can be applied if labour is fully interchangeable. In terms of labour assignment, we show that a distinct assignment pattern that differs between upstream and downstream stations improves performance if the routing is directed. Meanwhile, dispatching plays a less important role but creates important interaction effects with the assignment rule. Finally, the results suggest that increasing the service rate is a better response to the reduction in capacity that results from labour absenteeism than lowering the input frequency of work.     

Asymptotic optimality of shortest processing time-based algorithms for flow shop and open shop problems with nonlinear objective functions

This article investigates the criterion of minimizing total k-power completion time (TKCT) in flow shop and open shop scheduling. For these NP-hard problems, the asymptotic optimality of the shortest processing time-based algorithms is proven for a sufficiently large problem scale. To numerically evaluate the convergence of the algorithms, new lower bounds with performance guarantees are presented for the flow shop TKCT problem. Computational results demonstrate the performance of the proposed algorithms and the effectiveness of the nonlinear objective. In addition, theoretical results on the single-machine TKCT problem are obtained for mathematical deduction.     

基于遗传算法的平行流水作业计划方法

提出了平行机作业方式和流水作业方式的综合的作业方式,属于NP难问题.应用网络理论构造了平行流水作业的非连接图模型,可实现全局随机寻优的实基因编码遗传算法求解平行流水作业计划问题.选取各种规模的10余个标准算例,以加工流程时间为目标函数进行仿真.对每个算例进行10次随机计算,所得最优值与平均值差异率小于1.8%.对于reC39等大规模问题,10次随机计算的平均花费时间少于260s.     

A Novel Action Transformer Network for Hybrid Multimodal Sign Language Recognition

Sign language fills the communication gap for people with hearing and speaking ailments. It includes both visual modalities, manual gestures consisting of movements of hands, and non-manual gestures incorporating body movements including head, facial expressions, eyes, shoulder shrugging, etc. Previously both gestures have been detected; identifying separately may have better accuracy, but much communicational information is lost. A proper sign language mechanism is needed to detect manual and non-manual gestures to convey the appropriate detailed message to others. Our novel proposed system contributes as Sign Language Action Transformer Network (SLATN), localizing hand, body, and facial gestures in video sequences. Here we are expending a Transformer-style structural design as a “base network” to extract features from a spatiotemporal domain. The model impulsively learns to track individual persons and their action context in multiple frames. Furthermore, a “head network” emphasizes hand movement and facial expression simultaneously, which is often crucial to understanding sign language, using its attention mechanism for creating tight bounding boxes around classified gestures. The model’s work is later compared with the traditional identification methods of activity recognition. It not only works faster but achieves better accuracy as well. The model achieves overall 82.66% testing accuracy with a very considerable performance of computation with 94.13 Giga-Floating Point Operations per Second (G-FLOPS). Another contribution is a newly created dataset of Pakistan Sign Language for Manual and Non-Manual (PkSLMNM) gestures.     

The application of workload control in assembly job shops: an assessment by simulation

Workload control (WLC) is a production planning and control concept developed to meet the needs of small- and medium-sized make-to-order companies, where a job shop configuration is common. Although simulation has shown WLC can improve job shop performance, field researchers have encountered significant implementation challenges. One of the most notable challenges is the presence of ‘assembly job shops’ where product structures are more complex than typically modelled in simulation and where the final product consists of several sub-assemblies (or work orders) which have to be co-ordinated. WLC theory has not been developed sufficiently to handle such contexts, and the available literature on assembly job shops is limited. In response, this paper extends the applicability of WLC to assembly job shops by determining the best combination of: (i) WLC due date (DD) setting policy, (ii) release method and (iii) policy for coordinating the progress of work orders. When DDs are predominantly set by the company, the DD setting policy should play the leading role while the role of order release should be limited and the progress of work orders should not be co-ordinated in accordance with the DD of the final product. But when DDs are predominantly specified by customers, the importance of order release as a second workload balancing mechanism increases and work orders should be coordinated by backward scheduling from the DD of the final product. Results indicate that WLC can improve performance in assembly job shops and outperform alternative control policies. Future research should implement these findings in practice.