Modeling collaboration protocols for collaborative modeling tools: Experiences and applications

Over the last two decades, Collaborative Systems have become increasingly popular thanks to the many advances made in networks, communications and software tools. Within this field, Collaborative Modeling Systems apply the collaborative paradigm to the construction of (often visual) models, where users build diagrams from building blocks and the relationships between them. In these kinds of applications, the work is usually arranged into sessions, with the definition of some kind of time organization between those sessions. This organization is known as a collaboration protocol. Unfortunately, it is not usually easy to define these protocols, and many applications do not allow users to make any use of them.In an effort to overcome these difficulties, in this paper we propose a visual language for defining collaboration protocols for these systems. As such, in our language, sessions, artifacts and the transformations between them can be specified visually, and different coordination relationships (such as fork and join) can be defined. The visual language is included in a development method for collaborative systems that take advantage of the Eclipse platform in order to develop model-driven graphical editors that are enhanced with collaboration capabilities.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

LEGClust- a clustering algorithm based on layered entropic subgraphs.

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

Lateral inventory transshipment problem in online-to-offline supply chain

Online-to-offline (OTO) is a new commercial model with enormous market potential. Online customer orders are forwarded to the offline brick-and-mortar store to fulfil, which is a combination of dual-channel supply chain. OTO overcomes many disadvantages of the traditional dual-channel supply chain, but still faces uncertain market demand. To reduce the inventory risk caused by demand uncertainty, lateral inventory transshipment is employed in this paper to pool inventory risk in OTO supply chain. We model centralised OTO and decentralised OTO with/without transshipment, and then analyse different scenarios. Our results demonstrate that there exists a unique Nash equilibrium of inventory order levels in dual channels and an optimal transshipment price to maximise the profit of the entire supply chain. Finally, we provide a numerical example of uniform demand distribution. Our analyses offer many managerial insights and show that transshipment always benefits the OTO supply chain.     

Microwave-Assisted Fabrication of Superamphiphobic Surfaces on Aluminum Substrates

The field of superamphiphobic surface fabrication has evolved rapidly in the last decade; however, research on important issues such as sustainability and green chemistry procedures is still scarce. Herein, a simple method of microwave irradiation (MW) to minimize energy consumption during the preparation of superamphiphobic aluminum (Al) surfaces is reported. Al substrates are first etched in diluted HCl solutions to generate a microstructure and then irradiated in a commercial microwave unit for several time intervals, temperatures, and pressures. The surfaces are then coated with different compounds, and the wettability is tested with high and very-low surface tension liquids. Optical profilometry and scanning electron microscopy images show that the density of hierarchical micro-nanostructures increases with MW time, temperature, and pressure. At 170 °C and 7.9 bar, the surfaces present a high density of structures and re-entrant topographies. The obtained coatings display excellent repellence to liquids with surface tensions as low as 27.5 mN m⁻¹. X-ray photoelectron spectroscopy data show the importance of efficient surface functionalization for the production of superamphiphobicity in Al substrates. The results show that MW irradiation of Al substrates can be a green and efficient method for fabricating superamphiphobic surfaces.     

Iris recognition: Analysis of the error rates regarding the accuracy of the segmentation stage

Iris recognition has been widely used in several scenarios with very satisfactory results. As it is one of the earliest stages, the image segmentation is in the basis of the process and plays a crucial role in the success of the recognition task. In this paper we analyze the relationship between the accuracy of the iris segmentation process and the error rates of three typical iris recognition methods. We selected 5000 images of the UBIRIS, CASIA and ICE databases that the used segmentation algorithm can accurately segment and artificially simulated four types of segmentation inaccuracies. The obtained results allowed us to conclude about a strong relationship between translational segmentation inaccuracies – that lead to errors in phase – and the recognition error rates.