The way in which local data and data structures can be incorporated into untyped functional programming (FP) is demonstrated. A functional form called an infinite conditional (the CASE functional form) is added to the...
详细信息
The way in which local data and data structures can be incorporated into untyped functional programming (FP) is demonstrated. A functional form called an infinite conditional (the CASE functional form) is added to the set of functional forms. CASE can be used to select functions dynamically, which has the effect of transforming objects into functions. In order to simulate pointers in algorithms on data structures, CASE could be used to define functions, which has the effect of changing contents of nodes into selector functions. Objects are defined using data structures which support local data. None of the definitions violate the simple semantics of FP. The object definitions also provide a mechanism to incorporate I/O into the FP style of programming.< >
A typed framework for working with nonterminating computations is provided. The basic system is the calculus of constructions. It is extended using an original idea proposed by R. Constable and S.F. Smith (2nd Ann. IE...
详细信息
A typed framework for working with nonterminating computations is provided. The basic system is the calculus of constructions. It is extended using an original idea proposed by R. Constable and S.F. Smith (2nd Ann. IEEE Conf. on Logic in Comput. Sci., 1987) and implemented in Nuprl. From the computational point of view, an equivalent of the Kleene theorem for partial recursive functions over the integers within an index-free setting is obtained. A larger class of algebraic types is defined. Logical aspects need more examination, but a syntactic method for dealing with partial and total objects, leading to the notion of generic proof, is provided.< >
This paper presents initial results of a research study in the optimal scheduling (i.e., job sequencing) in Reentrant Manufacturing Lines (RML), motivated by applications in semiconductor manufacturing. In particular,...
详细信息
This paper presents initial results of a research study in the optimal scheduling (i.e., job sequencing) in Reentrant Manufacturing Lines (RML), motivated by applications in semiconductor manufacturing. In particular, a simple benchmark RML is utilized, and the optimal scheduling policy is analyzed for an infinite horizon discounted cost problem formulation. The optimality equation and condition are derived, and optimal policy results are obtained for general non-negative one-stage cost functions (in the buffer size). Computational experiments are also performed using the Modified Policy Iteration algorithm. Preliminary experiments on the application of a Neuro-Dynamic programming (NDP) method (i.e., Q-learning) to approximate the optimal scheduling policy are then presented, when linear and quadratic one-stage cost functions are considered. These experiments show that the Q-learning algorithm gradually approximates the optimal policy as the number of iterations increases and longer simulation lengths are utilized. However, the computational load required by the algorithm increases exponentially with the number of states. Results from this study represent an initial and exploratory research in the application of NDP methods to large-scale RML systems. More extensive research in both exact optimal results and efficient NDP schemes is in progress.
We examine how a network of many knowledge layers can be constructed in an online manner such that the learned units represent building blocks of knowledge that serve to compress the overall representation. Our novel ...
详细信息
We examine how a network of many knowledge layers can be constructed in an online manner such that the learned units represent building blocks of knowledge that serve to compress the overall representation. Our novel STL algorithm demonstrates a method for simultaneously acquiring and organizing a collection of concepts and functions as a many-layered network.
Global optimal solutions for nonconvex problems are found by first imbedding a nonconvex function into a higher-dimensional convex function and then by transforming the original problem into the problem of finding the...
详细信息
Global optimal solutions for nonconvex problems are found by first imbedding a nonconvex function into a higher-dimensional convex function and then by transforming the original problem into the problem of finding the mini-max solution of a related Lagrangian function. The imbedding is constructed by using the space of quadratic functions which are lower bounds for the original function. The Lagrangian function is constructed so that the associate dual cost function is concave and so that the global optimal solution can be obtained from the saddle point of the Lagrangian, which can be found using ordinary numerical methods. The duality gap for this Lagrangian is shown to vanish. For the case of one-dimensional global optimization, a working algorithm is presented.< >
When lambda expressions were introduced to the Java programming language as part of the release of Java 8 in 2014, they were the language’s first step into functional programming. Since lambda expressions are still r...
详细信息
As a standardized NGN architecture, the 3rd generation partnership project IP multimedia subsystem (IMS) defines standard service capabilities and interfaces, as well as a common IP-based infrastructure, which enable ...
详细信息
ISBN:
(纸本)0769527760;9780769527765
As a standardized NGN architecture, the 3rd generation partnership project IP multimedia subsystem (IMS) defines standard service capabilities and interfaces, as well as a common IP-based infrastructure, which enable operators to introduce new services in an efficient and flexible way. In order to exploit the capabilities offered by an IMS operator, multimedia application developers face a business challenge to create applications which can run on a variety of user devices, and possibly adapt to various network conditions and user preferences. Our goal was to identify common generic functionality related to session-level QoS signaling for advanced multimedia applications and to design a high-level application programming interface (API), which invokes this functionality. The paper describes the dynamic service adaptation model on which the proposed API is based, the API specification, and its implementation in Java. A prototype multimedia application featuring a 3D networked game provides an example of using the API
The widespread use of smart contracts results in high repeatability of their source code. The solution seems to lay in reusing the verification rules that check the feasibility of logically related transactions. The s...
详细信息
The widespread use of smart contracts results in high repeatability of their source code. The solution seems to lay in reusing the verification rules that check the feasibility of logically related transactions. The software allows for developing a smart contract that may process various transaction types. Besides, employing the package in implementing a smart contract eliminates the redundancy of verification rules. The package structure ensures the ability to handle actual smart contracts and transactions at the abstract level. Moreover, the article presents a proposal to standardize the way of designing the transaction verification function in a smart contract.
暂无评论