The Effectiveness of Short Message Service for Communication With Concerns of Privacy Protection and Conflict Avoidance

Why would people use Short Message Service (SMS) to say something they would not say in person? There is a trend that SMS is becoming more and more popular because it facilitates more extended modes of communications. Using technology acceptance model, we hypothesize the attitude of SMS would be influenced by its perceived effectiveness for communications, perceived ease of use, and subjective norm. Besides the special aspects of communications, conflict avoidance and privacy protection will enforce the impact of perceived effectiveness of SMS for communication. We investigated 953 SMS users and the results support most of our hypotheses. Furthermore, our analyses also show there are differences between females and males on the influence mechanism behind their attitude towards SMS.     

An integrated fuzzy multi-criteria approach for the performance evaluation of multiple manufacturing plants

The performance evaluation is regarded as a multiple criteria decision making (MCDM) problem and has a significant impact on the operations of the enterprise. This paper develops an integrated MCDM approach that combines the voting method and the fuzzy TOPSIS (technique for order preference by similarity to ideal solution) method to evaluate the performance of multiple manufacturing plants in a fuzzy environment. Fuzzy TOPSIS helps decision-makers carry out analysis and comparisons in ranking their preference of the alternatives with vague or imprecise data. Since the evaluation result is often greatly affected by the weights used in the evaluation process, the voting method is used in this study to determine the appropriate criteria weights. A case study demonstrating the applicability of the proposed model is presented. The case company is the world’s largest manufacturer of power supplies. It has three primary manufacturing bases located in Wujiang, Dongguan, and Tianjin, China. The proposed approach is used to evaluate the performance of the company’s five manufacturing plants in Wujiang, which produce switch power, telecom power, DC/DC converters, uninterruptible power systems (UPS) and AC/DC adapters.     

A revised method for ranking fuzzy numbers using maximizing set and minimizing set

A large number of methods have been proposed for ranking fuzzy numbers in the last few decades. Nevertheless, none of these methods can always guarantee a consistent result for every situation. Some of them are even non-intuitive and not discriminating. Chen proposed a ranking method in 1985 to overcome these limitations and simplify the computational procedure based on the criteria of total utility through maximizing set and minimizing set. However, there were some shortcomings associated with Chen’s ranking method. Therefore, we propose a revised ranking method that can overcome these shortcomings. Instead of considering just a single left and a single right utility in the total utility, the proposed method considers two left and two right utilities. In addition, the proposed method also takes into account the decision maker’s optimistic attitude of fuzzy numbers. Several comparative examples and an application demonstrating the usage, advantages, and applicability of the revised ranking method are presented. It can be concluded that the revised ranking method can effectively resolve the issues with Chen’s ranking method. Moreover, the revised ranking method can be used to differentiate different types of fuzzy numbers.     

Reconfigurable distributed storage for dynamic networks

This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures of the processing nodes, message delays, and message loss. The algorithm incorporates a classic quorum-based algorithm for read/write operations, and an optimized consensus protocol, based on Fast Paxos for reconfiguration, and achieves the design goals of: (i) allowing read and write operations to complete rapidly and (ii) providing long-term fault-tolerance through reconfiguration, a process that evolves the quorum configurations used by the read and write operations. The resulting algorithm tolerates dynamism. We formally prove our algorithm to be correct, we present its performance and compare it to existing reconfigurable memories, and we evaluate experimentally the cost of its reconfiguration mechanism.     

Information in the nonstationary case

Information estimates such as the direct method of Strong, Koberle, de Ruyter van Steveninck, and Bialek (1998) sidestep the difficult problem of estimating the joint distribution of response and stimulus by instead estimating the difference between the marginal and conditional entropies of the response. While this is an effective estimation strategy, it tempts the practitioner to ignore the role of the stimulus and the meaning of mutual information. We show here that as the number of trials increases indefinitely, the direct (or plug-in) estimate of marginal entropy converges (with probability 1) to the entropy of the time-averaged conditional distribution of the response, and the direct estimate of the conditional entropy converges to the time-averaged entropy of the conditional distribution of the response. Under joint stationarity and ergodicity of the response and stimulus, the difference of these quantities converges to the mutual information. When the stimulus is deterministic or nonstationary the direct estimate of information no longer estimates mutual information, which is no longer meaningful, but it remains a measure of variability of the response distribution across time.     

Symbol Grounding in Computational Systems: A Paradox of Intentions

The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to symbol grounding. In this case, no symbol grounding could take place since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or over meaningful symbols, computationalism implies semantic nativism.     

Whole-body hierarchical motion and force control for humanoid robots

Robots acting in human environments usually need to perform multiple motion and force tasks while respecting a set of constraints. When a physical contact with the environment is established, the newly activated force task or contact constraint may interfere with other tasks. The objective of this paper is to provide a control framework that can achieve real-time control of humanoid robots performing both strict and non strict prioritized motion and force tasks. It is a torque-based quasi-static control framework, which handles a dynamically changing task hierarchy with simultaneous priority transitions as well as activation or deactivation of tasks. A quadratic programming problem is solved to maintain desired task hierarchies, subject to constraints. A generalized projector is used to quantitatively regulate how much a task can influence or be influenced by other tasks through the modulation of a priority matrix. By the smooth variations of the priority matrix, sudden hierarchy rearrangements can be avoided to reduce the risk of instability. The effectiveness of this approach is demonstrated on both a simulated and a real humanoid robot.     

Gambling versus Designing: Organizing for the Design of the Probability Space in the Energy Sector

The objective of this paper is to elucidate an organizational process for the design of generic technologies (GTs). While recognizing the success of GTs, the literature on innovation management generally describes their design according to evolutionary strategies featuring multiple and uncertain trials, resulting in the discovery of common features among multiple applications. This random walk depends on multiple market and technological uncertainties that are considered exogenous: as smart as he can be, the ‘gambler’ must play in a given probability space. However, what happens when the innovator is not a gambler but a designer, i.e., when the actor is able to establish new links between previously independent emerging markets and technologies? Formally speaking, the actor designs a new probability space. Building on a case study of two technological development programmes at the French Center for Atomic Energy, we present cases of GTs that correspond to this logic of designing the probability space, i.e. the logic of intentionally designing common features that bridge the gap between a priori heterogeneous applications and technologies. This study provides another example showing that the usual trial‐and‐learning strategy is not the only strategy to design GTs and that these technologies can be designed by intentionally building new interdependences between markets and technologies. Our main result is that building these interdependences requires organizational patterns that correspond to a ‘design of exploration’ phase in which multiple technology suppliers and application providers are involved in designing both the probability space itself and the instruments to explore and benefit from this new space.     

Road‐Centered Map‐Aided Localization for Driverless Cars Using Single‐Frequency GNSS Receivers

Accurate localization with high availability is a key requirement for autonomous vehicles. It remains a major challenge when using automotive sensors such as single‐frequency Global Navigation Satellite System (GNSS) receivers, a lane detection camera, and proprioceptive sensors. This paper describes a method that enables the estimation of stand‐alone single‐frequency GNSS errors by integrating the measurements from a forward‐looking camera matched with lane markings stored in a digital map. It includes a parameter identification method for a shaping model, which is evaluated using experimental data. An algebraic observability study is then conducted to prove that the proposed state vector is fully observable in a road‐oriented frame. This observability property is the basis to develop a road‐centered Extended Kalman filter (EKF) that can maintain the observability of every component of the state vector on any road, whatever its orientation. To accomplish this, the filter needs to handle road changes, which it does using bijective transformations. The filter was implemented and tested intensely on an experimental vehicle for driverless valet parking services. Field results have shown that the performance of the estimation process is better than solutions based on EKF implemented in a fixed working frame. The proposed filter guarantees that the drift along the road direction remains bounded. This is very important when the vehicle navigates autonomously. Furthermore, the road‐centered modeling improves the accuracy, consistency, and robustness of the localization solver.     

Fast computation of minimal elementary decompositions of metabolic flux vectors

The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector can be expressed as a non-negative linear combination of a small number of elementary flux vectors. However a critical issue concerns the total number of elementary flux vectors which may be huge because it combinatorially increases with the size of the metabolic network. In this paper we present a fast algorithm that randomly computes a decomposition of admissible flux vectors in a minimal number of elementary flux vectors without explicitly enumerating all of them.