Change search
Refine search result
1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Davidsson, P.
    et al.
    Boman, Magnus
    KTH, School of Information and Communication Technology (ICT), Computer and Systems Sciences, DSV.
    Distributed monitoring and control of office buildings by embedded agents2005In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 171, no 4, p. 293-307Article in journal (Refereed)
    Abstract [en]

    We describe a decentralized system consisting of a collection of software agents that monitor and control an office building. It uses the existing power lines for communication between the agents and the electrical devices of the building, such as sensors and actuators for lights and heating. The objectives are both energy saving and increasing customer satisfaction through value added services. Results of qualitative simulations and quantitative analysis based on thermodynamical modeling of an office building and its staff using four different approaches for controlling the building indicate that significant energy savings can result from using the agent-based approach. The evaluation also shows that customer satisfaction can be increased in most situations. The approach here presented makes it possible to control the trade-off between energy saving and customer satisfaction (and actually increase both, in comparison with current approaches).

  • 2. Davidsson, Paul
    et al.
    Boman, Magnus
    Distributed Monitoring and Control of Office Buildings by Embedded Agents2005In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 171, no 4, p. 293-307Article in journal (Refereed)
    Abstract [en]

    We describe a decentralized system consisting of a collection of software agents that monitor and control an office building. It uses the existing power lines for communication between the agents and the electrical devices of the building, such as sensors and actuators for lights and heating. The objectives are both energy saving and increasing customer satisfaction through value added services. Results of qualitative simulations and quantitative analysis based on thermodynamical modeling of an office building and its staff using four different approaches for controlling the building indicate that significant energy savings can result from using the agent-based approach. The evaluation also shows that customer satisfaction can be increased in most situations. The approach here presented makes it possible to control the trade-off between energy saving and customer satisfaction (and actually increase both, in comparison with current approaches).

  • 3. Davidsson, Paul
    et al.
    Boman, Magnus
    Distributed Monitoring and Control of Office Buildings by Embedded Agents2005In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 171, no 4, p. 293-307Article in journal (Refereed)
    Abstract [en]

    We describe a decentralized system consisting of a collection of software agents that monitor and control an office building. It uses the existing power lines for communication between the agents and the electrical devices of the building, such as sensors and actuators for lights and heating. The objectives are both energy saving and increasing customer satisfaction through value added services. Results of qualitative simulations and quantitative analysis based on thermodynamical modeling of an office building and its staff using four different approaches for controlling the building indicate that significant energy savings can result from using the agent-based approach. The evaluation also shows that customer satisfaction can be increased in most situations. The approach here presented makes it possible to control the trade-off between energy saving and customer satisfaction (and actually increase both, in comparison with current approaches).

  • 4. Davidsson, Paul
    et al.
    Boman, Magnus
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Distributed monitoring and control of office buildings by embedded agents2005In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 171, p. 293-307Article in journal (Refereed)
  • 5.
    Fan, Qingfeng
    et al.
    Laboratoire DAVID, University of Versailles-Saint-Quentin.
    Xiong, Naixue
    School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Department of Business and Computer Science, Southwestern Oklahoma State University.
    Zeitouni, Karine
    Laboratoire DAVID, University of Versailles-Saint-Quentin.
    Wu, Qiongli
    Laboratory Applied Mathematics and Systems, Ecole Centrale de Paris.
    Tian, Yu-Chu
    School of Electrical Engineering and Computer Science, Queensland University of Technology.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Game Balanced Multi-factor Multicast Routing in Sensor Grid Networks2016In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 367-368, p. 550-572Article in journal (Refereed)
    Abstract [en]

    In increasingly important sensor grid networks, multicast routing is widely used in date aggregation and distributed query processing. It requires multicast trees for efficient data transmissions. However, sensor nodes in such networks typically have limited resources and computing power. Efforts have been made to consider the space, energy and data factors separately to optimize the network performance. Considering these factors simultaneously, this paper presents a game balance based multi-factor multicast routing approach for sensor grid networks. It integrates the three factors into a unified model through a linear combination. The model is standardized and then solved theoretically by using the concept of game balance from game theory. The solution gives Nash equilibrium, implying a well balanced result for all the three factors. The theoretic results are implemented in algorithms for cluster formation, cluster core selection, cluster tree construction, and multicast routing. Extensive simulation experiments show that the presented approach gives mostly better overall performance than benchmark methods

  • 6.
    Janzura, M.
    et al.
    Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic.
    Koski, Timo
    Luleå tekniska universitet.
    Otahal, A.
    Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic.
    Minimum entropy of error principle in estimation1994In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 79, no 1-2, p. 123-144Article in journal (Refereed)
    Abstract [en]

    The principle of minimum error entropy estimation as found in the work of Weidemann and Stear is reformulated as a problem of finding optimum locations of probability densities in a given mixture such that the resulting (differential) entropy is minimized. New results concerning the entropy lower bound are derived. Continuity of the entropy and attaining the minimum entropy are proved in the case where the mixture is finite. Some other examples and situations, in particular that of symmetric unimodal densities, are studied in more detail

  • 7.
    Jenkins, Samantha
    et al.
    University West, Department of Technology, Mathematics and Computer Science, Division for Computer Science.
    Kirk, Steven
    University West, Department of Technology, Mathematics and Computer Science, Division for Computer Science.
    Software architecture graphs as complex networks: a novel partitioning scheme to measure stability and evolution2007In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 177, no 12, p. 2587-2601Article in journal (Refereed)
    Abstract [en]

    The stability and evolution of the structure of consecutive versions of a series of software architecture graphs are analysed using the theory of complex networks. Brief comparisons are drawn between the scale-free behaviour and second order phase transitions. On this basis a software design metric Icc is proposed. This software metric is used to quantify the evolution of the stability vs. maintainability of the software through various releases. It is demonstrated that the classes in the software graph are acquiring more out-going calls than incoming calls as the software ages. Three examples of software applications where maintainability and continuous refactoring are an inherent part of their development process are presented, in addition to a Sun Java2 framework where growth and backward compatibility are the more important factors for the development. Further to this a projected future evolution of the software structure and maintainability is calculated. Suggestions for future applications to software engineering and the natural sciences are briefly presented.

  • 8.
    Jin, Junchen
    et al.
    KTH, School of Architecture and the Built Environment (ABE), Civil and Architectural Engineering, Transport planning. Enjoyor Co Ltd, Hangzhou 310030, Zhejiang, Peoples R China.
    Ma, Xiaoliang
    KTH, School of Architecture and the Built Environment (ABE), Civil and Architectural Engineering, Transport planning.
    A non-parametric Bayesian framework for traffic-state estimation at signalized intersections2019In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 498, p. 21-40Article in journal (Refereed)
    Abstract [en]

    An accurate and practical traffic-state estimation (TSE) method for signalized intersections plays an important role in real-time operations to facilitate efficient traffic management. This paper presents a generalized modeling framework for estimating traffic states at signalized intersections. The framework is non-parametric and data-driven, without any requirement on explicit modeling of traffic flow. The Bayesian filter (BF) approach is the core of the framework and introduces a recursive state estimation process. The required transition and measurement models of the BFs are trained using Gaussian process (GP) regression models with respect to a historical dataset. In addition to the detailed derivation of the integration of BFs and GP regression models, an algorithm based on the extended Kalman filter is presented for real-time traffic estimation. The effectiveness of the proposed framework is demonstrated through several numerical experiments using data generated in microscopic traffic simulations. Both fixed-location data (i.e., loop detector) and mobile data (i.e., connected vehicle) are examined with the framework. As a result, the method shows good performance under the different traffic conditions in the experiment. In particular, the approach is suitable for short-term estimation, a challenging task in traffic control and operations.

  • 9.
    Khrennikov, Andrei
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nonlocality as well as rejection of realism are only sufficient (but non-necessary!) conditions for violation of Bell's inequality2009In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 179, no 5, p. 492-504Article in journal (Refereed)
    Abstract [en]

    In this review we remind the viewpoint that violation of Bell’s inequality might be interpreted not only as an evidence of the alternative – either nonlocality or “death of reality” (under the assumption the quantum mechanics is incomplete). Violation of Bell’s type inequalities is a well known sufficient condition of probabilistic incompatibility of random variables – impossibility to realize them on a single probability space. Thus, in fact, we should take into account an additional interpretation of violation of Bell’s inequality – a few pairs of random variables (two-dimensional vector variables) involved in the EPR–Bohm experiment are incompatible. They could not be realized on a single Kolmogorov probability space. Thus, one can choose between: (a) completeness of quantum mechanics; (b) nonlocality; (c) “ death of reality”; (d) non-Kolmogorovness. In any event, violation of Bell’s inequality has a variety of possible interpretations. Hence, it could not be used to obtain the definite conclusion on the relation between quantum and classical models.

  • 10.
    Koski, Timo
    et al.
    Luleå tekniska universitet.
    Persson, Lars-Erik
    Luleå University of Technology, Department of Engineering Sciences and Mathematics, Mathematical Science.
    Some properties of generalized exponential entropies with applications to data compression1992In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 62, no 1, p. 103-132Article in journal (Refereed)
    Abstract [en]

    I. Csiszár discussed generalized entropies in his lecture at the Sixth Prague Conference on Information Theory. The authors emphasize that Csiszár noted the link between certain lower bounds for the quantization error and Rényi's differential entropy of order $\alpha$. Another important reference is the paper by L. L. Campbell where the concept of an exponential entropy was introduced. The authors investigate "several consequences that are of interest in the theory of data (or signal) compression". They also "investigate especially the exponential families of distributions, in particular the Miller-Thomas (or generalized Gaussian) family of distributions". The paper is a detailed discussion of the aforementioned problems coupled with examples and details of the possible applications. Exponential entropy is calculated for the uniform distribution, the univariate Gaussian distribution, the Laplace distribution, the Miller-Thomas distribution, an infinite-dimensional Gaussian exponential family, the Gauss-Laplace mixture and the multivariate Gaussian distribution. The extent of a distribution is given for the shape parameter in the Miller-Thomas distribution. Campbell's representation for E$[\alpha, 1 ; f]$ and the connection between an entropy series and data compression are discussed. A lower bound for the entropy of a partition (as defined in the paper) is given. Examples and proofs are illustrated with outputs from Mathematica.

  • 11.
    Li, Jun
    et al.
    College of Physics and Electronic Information Engineering, Wenzhou University, China, College of Computer Science, Zhejiang University, China.
    Zheng, Xiao-Lin
    College of Computer Science, Zhejiang University, China.
    Chen, Song-Tao
    College of Computer Science, Zhejiang University, China.
    Song, William Wei
    Dalarna University, School of Technology and Business Studies, Information Systems.
    Chen, De-Ren
    College of Computer Science, Zhejiang University, China.
    An efficient and reliable approach for quality-of-service-aware service composition2014In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 269, p. 238-254Article in journal (Refereed)
    Abstract [en]

    With the rapidly increasing number of independently developed Web services that provide similar functionalities with varied quality of service (QoS), service composition is considered as a problem in the selection of component services that are in accordance with users' QoS requirements; a practice known as the QoS-aware service composition problem. However, current solutions are unsuitable for most real-time decision-making service composition applications required to obtain a relatively optimal result within a reasonable amount of time. These services are also unreliable (or even risky) given the open service-oriented environment. In this paper, we address these problems and propose a novel heuristic algorithm for an efficient and reliable selection of trustworthy services in a service composition. The proposed algorithm consists of three steps. First, a trust-based selection method is used to filter untrustworthy component services. Second, convex hulls are constructed to reduce the search space in the process of service composition. Finally, a heuristic global optimization approach is used to obtain the near-optimal solution. The results demonstrate that our approach obtains a close-to-optimal and reliable solution within a reasonable computation time.

  • 12.
    Marinakis, Y.
    et al.
    Technical University of Crete, School of Production Engineering and Management, Chania, Greece.
    Marinaki, M.
    Technical University of Crete, School of Production Engineering and Management, Chania, Greece.
    Migdalas, Athanasios
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering. Aristotle University of Thessalonike, Department of Civil Engineering, Thessalonike, Greece.
    A Multi-Adaptive Particle Swarm Optimization for the Vehicle Routing Problem with Time Windows2019In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 481, p. 311-329Article in journal (Refereed)
    Abstract [en]

    In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is proposed for the solution of the Vehicle Routing Problem with Time Windows (VRPTW). Three different adaptive strategies are used in the proposed Multi-Adaptive Particle Swarm Optimization (MAPSO) algorithm. The first adaptive strategy concerns the use of a Greedy Randomized Adaptive Search Procedure (GRASP) that is applied when the initial solutions are produced and when a new solution is created during the iterations of the algorithm. The second adaptive strategy concerns the adaptiveness in the movement of the particles from one solution to another where a new adaptive strategy, the Adaptive Combinatorial Neighborhood Topology, is used. Finally, there is an adaptiveness in all parameters of the Particle Swarm Optimization algorithm. The algorithm starts with random values of the parameters and based on some conditions all parameters are adapted during the iterations. The algorithm was tested in the two classic sets of benchmark instances, the one that includes 56 instances with 100 nodes and the other that includes 300 instances with number of nodes varying between 200 and 1000. The algorithm was compared with other versions of PSO and with the best performing algorithms from the literature.

  • 13. Pan, Yuchen
    et al.
    Wu, Desheng
    Stockholm University, Faculty of Social Sciences, Stockholm Business School. University of Chinese Academy of Sciences, China.
    Luo, Cuicui
    Stockholm University, Faculty of Social Sciences, Stockholm Business School.
    Dolgui, Alexandre
    User activity measurement in rating-based online-to-offline (O2O) service recommendation2019In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 479, p. 180-196Article in journal (Refereed)
    Abstract [en]

    The increasing popularity of O2O service make more and more people begin seeking and booking services online. After that, they experience the services in brick-and-mortar stores. This new business model has marketing potential and offer various opportunities to different industries. Consequently, various O2O services starting to appear, which results in difficult service selections for customers. Therefore, in this paper, we proposed a novel rating-based O2O service recommendation model considering user activity. In this method, the traditional similarity estimations are substituted by user activity which can better reflect the differentiations of customers' behavioral characteristics. Therefore, recommendations are more accurate. The experimental results show that proposed method outperforms rating-based methods, including widely used collaborative filtering methods and state-of-the-art matrix methods. In addition, we find the optimal parameter values of our model, and explore the influence of Top-k on rating-based recommendation.

  • 14.
    Roy, Sisir
    et al.
    Indian Statistical Institute.
    Kundu, Malay K.
    Indian Statistical Institute.
    Granlund, Gösta H.
    Linköping University, Department of Electrical Engineering, Computer Vision . Linköping University, The Institute of Technology.
    Uncertainty Relations and Time-Frequency Distributions for Unsharp Observables1996In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 89, no 3-4, p. 193-209Article in journal (Refereed)
    Abstract [en]

    This paper deals with a new framework in analyzing the formal mathematical correspondence between quantum mechanics and time-frequency representations of a signal. It is also shown that joint time-frequency distributions have a close link with Heisenberg uncertainty relations if the observables are taken as fuzzy entities. This result contradicts the arguments of Cohen [IEEE Proc. 77(7):941 (1989)] regarding the time-frequency distributions and the uncertainty relation. It is postulated that these mechanisms will be of crucial importance in highly fragmented computation structures, such as neural networks, as they may exhibit a strong mutual interaction between data and operator.

  • 15.
    Wang, Chunpeng
    et al.
    Qilu University of Technology (Shandong Academy of Sciences), Jinan, China; Dalian University of Technology, Dalian, China.
    Wang, Xingyuan
    Dalian Maritime University, Dalian, China; Dalian University of Technology, Dalian, China.
    Li, Yongwei
    Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Systems and Technology.
    Xia, Zhiqiu
    Dalian University of Technology, Dalian, China.
    Zhang, Chuan
    Dalian University of Technology, Dalian, China.
    Quaternion polar harmonic Fourier moments for color images2018In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 450, p. 141-156Article in journal (Refereed)
    Abstract [en]

    This paper proposes quaternion polar harmonic Fourier moments (QPHFM) for color image processing and analyzes the properties of QPHFM. After extending Chebyshev–Fourier moments (CHFM) to quaternion Chebyshev-Fourier moments (QCHFM), comparison experiments, including image reconstruction and color image object recognition, on the performance of QPHFM and quaternion Zernike moments (QZM), quaternion pseudo-Zernike moments (QPZM), quaternion orthogonal Fourier-Mellin moments (QOFMM), QCHFM, and quaternion radial harmonic Fourier moments (QRHFM) are carried out. Experimental results show QPHFM can achieve an ideal performance in image reconstruction and invariant object recognition in noise-free and noisy conditions. In addition, this paper discusses the importance of phase information of quaternion orthogonal moments in image reconstruction. 

  • 16.
    Wei, Wei
    et al.
    School of Computer Science and Engineering, Xi’an University of Technology.
    Song, Houbing
    Department of Electrical and Computer Engineering, West Virginia University, Montgomery, WV .
    Li, Wei
    Centre for Distributed and High Performance Computing, School of Information Technologies, The University of Sydney.
    Shen, Peiyi
    National school of Software, Xidian University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Gradient-driven parking navigation using a continuous information potential field based on wireless sensor network2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 408, p. 100-114Article in journal (Refereed)
    Abstract [en]

    Wireless sensor networks can support building and transportation system automation in numerous ways. An emerging application is to guide drivers to promptly locate vacant parking spaces in large parking structures during peak hours. This paper proposes efficient parking navigation via a continuous information potential field and gradient ascent method. Our theoretical analysis proves the convergence of a proposed algorithm and efficient convergence during the first and second steps of the algorithm to effectively prevent parking navigation from a gridlock situation. The empirical study demonstrates that the proposed algorithm performs more efficiently than existing algorithms.

  • 17.
    Wu, Dan
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Håkansson, Anne
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    A method for creating and using a context knowledge base for ontology integration2014In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291Article in journal (Refereed)
    Abstract [en]

    Ontology integrations are applied for generating new ontologies used for providing advanced services. Although many algorithms and systems for ontology integration have been proposed, it is still very difficult to achieve semantic and pragmatic ontology matching and integration. To tackle the problems, a method of building and using a context knowledge base is needed to get the context of ontologies used for matching and integration. In the method, a context knowledge base with context rules is developed upon an ontology repository to improve the ontology integration. In the context knowledge base, context rules use Ontology Metadata Vocabulary to describe contexts. The stored ontologies that in the repository satisfy a particular context, are extracted and integrated automatically to form contextual information. In the contextual information, both the consistent ontological definitions and the different perspectives from various ontologies of string-identical entities are used. For new ontology integrations, context rules are searched and triggered according to the context of the ontology integration at hand. The contextual information of the rules is aggregated for improving the new ontology integration. Meta-rules are also automatically built to be able to apply the context rules in a hierarchical relation. Experiments of integrations show that the context knowledge base provides extra contextual information for ontology integration. Moreover, when comparing an integration using the context knowledge base to an ontology integration without the context knowledge base, the results of the contextual ontology integrations are improved. At the same time, it is observed that the quantity and the quality of the stored ontologies, in a repository, determine the quality of the context knowledge base. The better quality and quantity of the context knowledge base, the higher degree of improvement it infers to the contextual ontology integrations.

  • 18.
    Xia, Zhihua
    et al.
    Jiangsu Engineering Center of Network Monitoring, Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology, College of Computer and Software, Nanjing University of Information Science & Technology.
    Xiong, Neal N.
    Department of Business and Computer Science, Southwestern Oklahoma State University.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Sun, Xingming
    Jiangsu Engineering Center of Network Monitoring, Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology, College of Computer and Software, Nanjing University of Information Science & Technology.
    EPCBIR: An efficient and privacy-preserving content-based image retrieval scheme in cloud computing2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 387, p. 195-204Article in journal (Refereed)
    Abstract [en]

    The content-based image retrieval (CBIR) has been widely studied along with the increasing importance of images in our daily life. Compared with the text documents, images consume much more storage and thus are very suitable to be stored on the cloud servers. The outsourcing of CBIR to the cloud servers can be a very typical service in cloud computing. For the privacy-preserving purposes, sensitive images, such as medical and personal images, need to be encrypted before being outsourced, which will cause the CBIR technologies in plaintext domain unusable. In this paper, we propose a scheme that supports CBIR over the encrypted images without revealing the sensitive information to the cloud server. Firstly, the feature vectors are extracted to represent the corresponding images. Then, the pre-filter tables are constructed with the locality-sensitive hashing to increase the search efficiency. Next, the feature vectors are protected by the secure k-nearest neighbor (kNN) algorithm. The security analysis and experiments show the security and efficiency of the proposed scheme.

  • 19. Yan, Su-Rong
    et al.
    Zheng, Xiao-Lin
    Wang, Yan
    Song, William Wei
    Dalarna University, School of Technology and Business Studies, Information Systems.
    Zhang, Wen-Yu
    A graph-based comprehensive reputation model: exploiting the social context of opinions to enhance trust in social commerce2015In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 318, p. 51-72Article in journal (Refereed)
    Abstract [en]

    Social commerce is a promising new paradigm of e-commerce. Given the open and dynamic nature of social media infrastructure, the governance structures of social commerce are usually realized through reputation mechanisms. However, the existing approaches to the prediction of trust in future interactions are based on personal observations and/or publicly shared information in social commerce application. As a result, the indications are unreliable and biased because of limited first-hand information and stake-holder manipulation for personal strategic interests. Methods that extract trust values from social links among users can improve the performance of reputation mechanisms. Nonetheless, these links may not always be available and are typically sparse in social commerce, especially for new users. Thus, this study proposes a new graph-based comprehensive reputation model to build trust by fully exploiting the social context of opinions based on the activities and relationship networks of opinion contributors. The proposed model incorporates the behavioral activities and social relationship reputations of users to combat the scarcity of first-hand information and identifies a set of critical trust factors to mitigate the subjectivity of opinions and the dynamics of behaviors. Furthermore, we enhance the model by developing a novel deception filtering approach to discard "bad-mouthing" opinions and by exploiting a personalized direct distrust (risk) metric to identify malicious providers. Experimental results show that the proposed reputation model can outperform other trust and reputation models in most cases. (C) 2014 Elsevier Inc. All rights reserved.

  • 20.
    Yi,, J.-H.
    et al.
    School of Mathematics and Big Data, Foshan University, Foshan, China; School of Information and Control Engineering, Qingdao University of Technology, Qingdao, China.
    Xing, L. -N.
    School of Mathematics and Big Data, Foshan University, Foshan, China.
    Wang, G.-G.
    Department of Computer Science and Technology, Ocean University of China, Qingdao, China.
    Dong, J.
    Department of Computer Science and Technology, Ocean University of China, Qingdao, China.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Alavi, A.H.
    Department of Civil and Environmental Engineering, University of Missouri, Columbia, United States.
    Wang, L.
    Department of Automation, Tsinghua University, Beijing, China.
    Behavior of crossover operators in NSGA-III for large-scale optimization problems2020In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 509, p. 470-487Article in journal (Refereed)
    Abstract [en]

    Traditional multi-objective optimization evolutionary algorithms (MOEAs) do not usually meet the requirements for online data processing because of their high computational costs. This drawback has resulted in difficulties in the deployment of MOEAs for multi-objective, large-scale optimization problems. Among different evolutionary algorithms, non-dominated sorting genetic algorithm-the third version (NSGA-III) is a fairly new method capable of solving large-scale optimization problems with acceptable computational requirements. In this paper, the performance of three crossover operators of the NSGA-III algorithm is benchmarked using a large-scale optimization problem based on human electroencephalogram (EEG) signal processing. The studied operators are simulated binary (SBX), uniform crossover (UC), and single point (SI) crossovers. Furthermore, enhanced versions of the NSGA-III algorithm are proposed through introducing the concept of Stud and designing several improved crossover operators of SBX, UC, and SI. The performance of the proposed NSGA-III variants is verified on six large-scale optimization problems. Experimental results indicate that the NSGA-III methods with UC and UC-Stud (UCS) outperform the other developed variants.

  • 21.
    Zhang, Qingke
    et al.
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Liu, Weiguo
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Men, Xiangxu
    School of Computer Science and technology, Engineering Research Center of Digital Media Technology, Ministry of Education, Shandong University, Jinan.
    Jiang, Bo
    Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan.
    Vasilakos, Athanasios
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Vector coevolving particle swarm optimization algorithm2017In: Information Sciences, ISSN 0020-0255, E-ISSN 1872-6291, Vol. 394-395, p. 273-298Article in journal (Refereed)
    Abstract [en]

    In this paper, we propose a novel vector coevolving particle swarm optimization algorithm (VCPSO). In VCPSO, the full dimension of each particle is first randomly partitioned into several sub-dimensions. Then, we randomly assign either one of our newly designed scalar operators or learning operators to update the values in each sub-dimension. The scalar operators are designed to enhance the population diversity and avoid premature convergence. In addition, the learning operators are designed to enhance the global and local search ability. The proposed algorithm is compared with several other classical swarm optimizers on thirty-three benchmark functions. Comprehensive experimental results show that VCPSO displays a better or comparable performance compared to the other algorithms in terms of solution accuracy and statistical results.

1 - 21 of 21
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf