Scala转入商务管理

Scala公司6月3日在京宣布了新产品Scala Global Series,该产品系列包括Scala标准版、Scala高级版、Scala电子商务解决方案和Scala开发者版,其中Scala开发者版为开发人员提供了基于VBA(Visual Basic Application)进行应用开发和定制的应用程序接口。     

Scala充电国内ERP市场

4月7日获悉:Scala 公司陆续开始了它在中国的 ERP 培训活动,到目前为止已开设了15门课程,77人接受了 Scala 的顾问指导培训以及进一步有关Scala 5财务和后勤方面的培训。其学员大多来自于财务及信息技术部门。Scala 公司表示,不仅要向中国输     

管理不再无序

医药行业的业务管理模式通常是把各业务环节分割为一个个独立的系统。但随着医药行业的发展,业内急需一种能够满足医药行业特殊需求的一体化标准解决方案。 Scala商务解决方案公司推出了其创新性的Scala医药行业垂直业务应用解决方案——Scala Pharma。它集成了适用于任何医药企业的物资采购、销售订单、库存控制和生产管理等功能,并针对医药行业客户的特点提供了特别设计的仓库发货工具模块,可从采购到销售运输全过程地     

特别方案渡千年

Scala 公司公布了“Scala 2000年问题特别保护方案”(www.scala.se/Year2000IC),该项方案是专为那些还没有解决财务会计系统中的2000年问题的企业设计的。使用 Scala 的六步骤 Signature 实施方法,Scala 2000年特别保护方案的实施仅仅需要3到6周的时间。它完全符合基础会计和财务报表中的2000年标准。此新产     

eBiz管理全集成——Scala推出Scala Global Series

Scala推出了Scala Business Solutions的全球系列——Scala Global Series,它是全集成的电子商务管理解决方案,可管理众多的商务流程,具有多语言能力(被译成30多种语言),且全面支持跨国公司对世界各货币的要求。它运行于Microsoft SQL 7.0之上,支持Windows 2000。     

柏瑞安上Scala管理软件

5月21获悉,北京柏瑞安科技有限责任公司将实施Scala的财务、物流和生产等模块。北京柏瑞安希望通过Scala的软件提高公司管理层把握公司运营状况的能力,改     

SCALA发布新产品scala 5

Scala商务解决方案公司近日公布了其支持微软SQL服务器的新产品——Scala 5。该产品于1997年11月开始在欧洲供货,并已得到用户和分析家们的好评。     

Scala5.1获VBA认证

商务管理与电子商务解决方案厂商思佳公司(Scala)宣布,其 Scala5.1开发者版已通过了微软授权 VeriTest 公司进行的软件认证测试,成功地获得了VBA 标志。继1999年2月获得了微软公司的VBA6.0使用权后,思佳于9月又推出了Scala 5.1开发者版。这个版本包含一套功能丰富的 VBA 定制环境,可以帮助用     

Scala借力微软挺进CRM

7月22日Scala Business Solutions宣布与微软公司签订合作意向书,为微软企业管理系统解决方案部的CRM软件开发扩展功能,并集成到iScala协同ERP系统之中。两公司将携手开发功能更强大的基于微软CRM的系统,并将由Scala公司以iScala CRM的产品名向市场销售。这个新产品将集成到iScala ERP产品中,并将作为完整解决方案提供给Scala的全球客户。预计将在今年9月最终签订该协议。     

消息树

IBM公司与Joumyx公司共同宣布,采用了IBM的WebSphere和DB2通用数据库的JournyxTIME软件正式面世。 JournyxTIME是一种独立于平台的解决方案,工作人员及其管理人员可利用Web浏览器对每个项目的工期和开发状况进行追踪报告。此外,JoumyxTIME还可与IBM的MQSeries集成,进行消息排队和信息交换。最近Scala公司的Scala 5 GlobalSeries通过微软BackOffice的认证,在阿姆斯特丹VeriTest测试中心,Scala 5     

Scala and Lift Functional Recipes for the Web

Today, there's significant interest in functional languages and frameworks that fit the Web better than imperative languages. We explore Scala, an OO-functional language on the Java virtual machine, and Lift, a framework implemented on Scala's functional features. The Scala language offers functional programming features and asynchronous message-passing concurrency alongside a statically typed model. Lift exploits this model to offer secure, higher-level abstractions to Web developers.     

Automatically Identifying Calling-Prone Higher-Order Functions of Scala Programs to Assist Testers

For the rapid development of internetware, functional programming languages, such as Haskell and Scala, can be used to implement complex domain-specific applications. In functional programming languages, a higher-order function is a function that takes functions as parameters or returns a function. Using higher-order functions in programs can increase the generality and reduce the redundancy of source code. To test a higher-order function, a tester needs to check the requirements and write another function as the test input. However, due to the complex structure of higher-order functions, testing higher-order functions is a time-consuming and labor-intensive task. Testers have to spend an amount of manual effort in testing all higher-order functions. Such testing is infeasible if the time budget is limited, such as a period before a project release. In practice, not every higher-order function is actually called. We refer to higher-order functions that are about to be called as calling-prone ones. Calling-prone higher-order functions should be tested first. In this paper, we propose an automatic approach, namely Phof, which predicts whether a higher-order function of Scala programs will be called in the future, i.e., identifying calling-prone higher-order functions. Our approach can assist testers to reduce the number of higher-order functions of Scala programs under test. In Phof, we extracted 24 features from source code and logs to train a predictive model based on known higher-order function calls. We empirically evaluated our approach on 4 832 higher-order functions from 27 real-world Scala projects. Experimental results show that Phof based on the random forest algorithm and the Synthetic Minority Oversampling Technique Processing strategy (SMOTE) performs well in the prediction of calls of higher-order functions. Our work can be used to support the scheduling of limited test resources.

     

Functional Programming Library for C++

Programming and Computer Software - Modern functional programming languages, such as Haskell, Scala, ML, and F#, have properties that make it possible to implement logically complicated algorithms...     

Software transactional memories for Scala

Transactional memory is an alternative to locks for handling concurrency in multi-threaded environments. Instead of providing critical regions that only one thread can enter at a time, transactional memory records sufficient information to detect and correct for conflicts if they occur. This paper surveys the range of options for implementing software transactional memory in Scala. Where possible, we provide references to implementations that instantiate each technique. As part of this survey, we document for the first time several techniques developed in the implementation of Manchester University Transactions for Scala. We order the implementation techniques on a scale moving from the least to the most invasive in terms of modifications to the compilation and runtime environment. This shows that, while the less invasive options are easier to implement and more common, they are more verbose and invasive in the codes using them, often requiring changes to the syntax and program structure throughout the code.     

<Emphasis FontCategory="SansSerif">Mnemonics</Emphasis>: type-safe bytecode generation at run time

Mnemonics is a Scala library for generating method bodies in JVM bytecode at run time. Mnemonics supports a large subset of the JVM instructions, for which the static typing of the generator guarantees the well-formedness of the generated bytecode.     

Actor model of Anemone functional language

This paper describes actor system of a new functional language called Anemone and compares it with actor systems of Scala and Erlang. Implementation details of the actor system are described. Performance evaluation is provided on sequential and concurrent programs.     

ATR4S: toolkit with state-of-the-art automatic terms recognition methods in Scala

Automatically recognized terminology is widely used for various domain-specific texts processing tasks, such as machine translation, information retrieval or ontology construction. However, there is still no agreement on which methods are best suited for particular settings and, moreover, there is no reliable comparison of already developed methods. We believe that one of the main reasons is the lack of state-of-the-art method implementations, which are usually non-trivial to recreate—mostly, in terms of software engineering efforts. In order to address these issues, we present ATR4S, an open-source software written in Scala that comprises 13 state-of-the-art methods for automatic terminology recognition (ATR) and implements the whole pipeline from text document preprocessing, to term candidates collection, term candidate scoring, and finally, term candidate ranking. It is highly scalable, modular and configurable tool with support of automatic caching. We also compare 13 state-of-the-art methods on 7 open datasets by average precision and processing time. Experimental comparison reveals that no single method demonstrates best average precision for all datasets and that other available tools for ATR do not contain the best methods.     

Extension of scala language by distributed and parallel computing tools with Linda coordination system

The paper describes a new library developed for Linda language implementation for Scala programming language (language support of the component programming software). The library uses client-server architecture and a database for the tuple space representation. It implements the search for similarities and “primitive” and additional operations. The library can be used for distributed and parallel application development.     

A pure embedding of attribute grammars

Attribute grammars are a powerful specification paradigm for many language processing tasks, particularly semantic analysis of programming languages. Recent attribute grammar systems use dynamic scheduling algorithms to evaluate attributes on demand. In this paper, we show how to remove the need for a generator, by embedding a dynamic approach in a modern, object-oriented and functional programming language. The result is a small, lightweight attribute grammar library that is part of our larger Kiama language processing library. Kiama’s attribute grammar library supports a range of advanced features including cached, uncached, higher order, parameterised and circular attributes. Forwarding is available to modularise higher order attributes and decorators abstract away from the details of attribute value propagation. Kiama also implements new techniques for dynamic extension and variation of attribute equations. We use the Scala programming language because of its support for domain-specific notations and emphasis on scalability. Unlike generators with specialised notation, Kiama attribute grammars use standard Scala notations such as pattern-matching functions for equations, traits and mixins for composition and implicit parameters for forwarding. A benchmarking exercise shows that our approach is practical for realistic language processing.     

基于Java平台的多语言混合编程

Java领域混合语言编程时代已经到来。本文首先回顾静态类型语言和动态类型语言、命令式语言和声明式语言的基本概念和各自的优缺点,然后介绍Java语言的发展趋势和基于Java Virture Machine的代表性语言Jython、JRuby、Groovy、Scala和Clojure,最后指出软件项目的未来在于混合语言编程,Java仍将是JVM生态系统中的重要组成部分。