ParisTech

About: ParisTech is a education organization based out in Paris, France. It is known for research contribution in the topics: Finite element method & Residual stress. The organization has 1888 authors who have published 1965 publications receiving 55532 citations. The organization is also known as: Paris Institute of Technology & ParisTech Développement.

Limits of Kansei - Kansei Unlimited

Abstract: This paper discusses momentary limitations of Kansei Engineering methods. There are for example the focus on the evaluation of colour and form factors, as well as the highly time consuming creation of the Kansei questionnaires. To overcome these limits we firstly, suggest the integration of related scientific research results on product emotions etc. in the Kansei questionnaires. Thereafter we present a study on the wide range of Kansei aspects treated in an industrial conception setting. The results together with the literature review lead us to a framework on user-centred product conception aspects. This framework unfolds potential expansion points for Kansei contents. Both perspectives underline the potential of Kansei Engineering for future applications and show our vision of Kansei Engineering beyond the limits.

Modeling Non-Functional Properties for Human-Machine Systems

Abstract: A Human-Machine system is a complex system consisting of many components and services that dynamically compose to achieve a specific goal. The functional and non-functional attributes of the components are considered to make ’who does, what, andwhen’ decisionsdepending on theoperational context. However, non-functional properties are not given sufficient importance compared to that of the functional requirements during the developmental stages. This paper highlights the importance of non-functional properties in humanmachine systems and proposes a metamodel for modeling those properties. A case study on assistive lane keeping in automobiles is presented to demonstrate how the non-functional properties can be modeled. This is a part of the intermediate results of a research in progress for modeling decision architectures for autonomous systems.

Method of tracing and of resurgence of pseudonymized streams on communication networks, and method of sending informative streams able to secure the data traffic and its addressees

Abstract: The network comprising communication supports (31, 32, 33) sending streams (36) to receiving agents (37, 38, 39), the method comprises at least: - a step of allocating a cryptonymic identity (34) to communication supports by a first instance A, the streams (36) sent by a support bearing a mark dependent on its cryptonym, the cryptonymic identity of a support being distinct from its real identity; - a step of reading and analyzing (41, 42) the streams by a second instance B (22), said analysis comprising a phase of identifying streams to their communication supports by searching for similitude between the mark of the streams and the cryptonymic identity of the supports, with the aid of a table referencing the cryptonyms, and a phase of logging observable characteristics of the streams through the network; a behaviour defined by a set of characteristics is declared typical or atypical by comparison with a given set of criteria, the table of cryptonymic identities having no relationship with the real identities. The invention applies in particular for combating illegal downloads, the sending of material which is unsolicited or which may cover up identifiable malicious intentions.

Optimal Opportunistic Forwarding with Energy Constraint for DTN

Abstract: In Delay Tolerant Networks, energy efficient forwarding algorithms are significant to enhance the performance of messages' transmission probability. In this paper, we focus on the problem of optimal opportunistic epidemic forwarding with energy constraint. By introducing a continuous time model, we obtain the optimal static and dynamic policies for multi-messages forwarding. Extensive simulations show that the optimal dynamic policy achieves about $26\%$ higher transmission probability than the static policy while the number of messages decreases the average transmission probability.