Crowdfunding

Crowdfunding, as we know it today, is a very recent activity that was born almost accidentally in the end of the 90’s decade. Due to the advent of the internet and the social networks, entrepreneurs are now able to promote their projects to a very large community. Whether it is composed by family, friends, acquaintances or simply people that are interested in the same topic or share the passion, the community is able to fund new ventures by individually investing modest amounts of money. In return, the entrepreneur can offer symbolic rewards, shares or other financial returns. New crowdfunding platforms are born almost every day all over the world, offering a new way of raising capital for their projects or a new way to invest their money in innovative ventures. Although crowdfunding is still finding its place in the financial services, successful cases such as Kickstarter demonstrate the power of the crowd in boosting creativity and productivity, financing thousands of projects by raising millions of dollars from thousands of investors. Due to regulatory restrictions, the most prominent model for now is reward-based crowdfunding, where the investors are prized with symbolic returns or privileged access to the products or services offered by the entrepreneurs. Other models such as peer-to-peer lending are also surging, allowing borrowers access to capital at a lower cost compared to so-called traditional financial institutions, and offering lenders a higher rate of return. But when it comes to offering shares to investors, i.e. using equity-based crowdfunding, entrepreneurs face regulatory obstacles in almost every country, where legislation was passed decades ago with the objective of promoting financially-capable ventures and protecting investors. Access to capital has become more difficult after the global economic recession of 2008, and for most countries it will not get easier in the near future, leaving start-ups and small enterprises with few options to start or expand their operations. In this study we attempt to answer the following research questions: how has equity-based crowdfunding evolved since its creation? Where and how has equity-based crowdfunding been implemented so far? What are the constraints and opportunities for implementing equity-crowdfunding in the world, and more particularly in Portugal? Finally, we will discuss the risks of crowdfunding and reflect on the future of this industry.

Community indentification in peer-t-peer collaborative consumption services

Even though collaborative consumption (CC) is gaining economic importance, research in CC is still in its infancy. Consumers’ reasons for participating have already been investigated but little research on consequences of participation has been conducted. This article examines whether interactions between customers in peer-to-peer CC services influence the willingness to coproduce service outcomes. Drawing on social exchange theory, it is proposed that this effect is mediated by consumers’ identification with the brand community. Furthermore, continuance intention in CC is introduced as a second stage moderator. In a cross-sectional study, customers of peer-to-peer accommodation sharing are surveyed. While customer-to-customer interactions were found to have a positive effect on brand community identification, brand community identification did not positively affect co-production intention. Surprisingly, the effect of brand community identification on co-production intention was negative. Moreover, continuance intention of customers did not moderate this relationship. Bearing in mind current challenges for researchers and companies, theoretical and managerial implications are discussed.

Properties of functional brain networks correlate with frequency of psychogenic non-epileptic seizures.

Abnormalities in the topology of brain networks may be an important feature and etiological factor for psychogenic non-epileptic seizures (PNES). To explore this possibility, we applied a graph theoretical approach to functional networks based on resting state EEGs from 13 PNES patients and 13 age- and gender-matched controls. The networks were extracted from Laplacian-transformed time-series by a cross-correlation method. PNES patients showed close to normal local and global connectivity and small-world structure, estimated with clustering coefficient, modularity, global efficiency, and small-worldness (SW) metrics, respectively. Yet the number of PNES attacks per month correlated with a weakness of local connectedness and a skewed balance between local and global connectedness quantified with SW, all in EEG alpha band. In beta band, patients demonstrated above-normal resiliency, measured with assortativity coefficient, which also correlated with the frequency of PNES attacks. This interictal EEG phenotype may help improve differentiation between PNES and epilepsy. The results also suggest that local connectivity could be a target for therapeutic interventions in PNES. Selective modulation (strengthening) of local connectivity might improve the skewed balance between local and global connectivity and so prevent PNES events.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.

Le régime de la copie privée face à Internet

Le présent article vise à exposer la situation du régime de la copie privée face à Internet, tant dans son application que dans sa légitimité. L’auteur soumet notamment que l’exception de la copie privée n’est applicable ni à la mise à disposition ni au téléchargement de fichiers musicaux sur Internet à moins que, quant à ce dernier acte, la copie provienne d’une source licite, ce qui exclut les réseaux peer-to-peer. Ensuite, l’auteur analyse la question quant à savoir si les enregistreurs audionumériques et les disques durs des ordinateurs personnels devraient être soumis aux redevances au Canada, et conclut à l’effet qu’une réforme de la Loi sur le droit d’auteur est de mise si l’on veut en arriver à une telle éventualité. Finalement dans la dernière partie, l’auteur soulève la question de la remise en cause du régime de la copie privée face à l’importance grandissante que l‘on accorde à la gestion numérique des droits.

Impact of Node Mobility on Routing Protocols for Wireless Sensor Networks

Wireless sensor networks monitor their surrounding environment for the occurrence of some anticipated phenomenon. Most of the research related to sensor networks considers the static deployment of sensor nodes. Mobility of sensor node can be considered as an extra dimension of complexity, which poses interesting and challenging problems. Node mobility is a very important aspect in the design of effective routing algorithm for mobile wireless networks. In this work we intent to present the impact of different mobility models on the performance of the wireless sensor networks. Routing characteristics of various routing protocols for ad-hoc network were studied considering different mobility models. Performance metrics such as end-to-end delay, throughput and routing load were considered and their variations in the case of mobility models like Freeway, RPGM were studied. This work will be useful to figure out the characteristics of routing protocols depending on the mobility patterns of sensors

Content aggregation on knowledge bases using graph clustering

Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.

Keyword Join: Realizing Keyword Search in P2P-based Database Systems

In this paper, we present a P2P-based database sharing system that provides information sharing capabilities through keyword-based search techniques. Our system requires neither a global schema nor schema mappings between different databases, and our keyword-based search algorithms are robust in the presence of frequent changes in the content and membership of peers. To facilitate data integration, we introduce keyword join operator to combine partial answers containing different keywords into complete answers. We also present an efficient algorithm that optimize the keyword join operations for partial answer integration. Our experimental study on both real and synthetic datasets demonstrates the effectiveness of our algorithms, and the efficiency of the proposed query processing strategies.

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Utilidad de los conceptos y estrategias comunitarias en el marketing online para la prevención de la copia ilegal en el mercado musical

Esta investigación se dirige a determinar cuál es la utilidad de los conceptos y estrategias comunitarias en el marketing online para la prevención de la copia ilegal en el mercado musical. Con este proyecto se desea que por medio de una nueva disquera enfocada en el comercio online, y usando los conceptos del mercadeo comunitario y el mercadeo relacional, se pueda desarrollar nuevas estrategias de mercadeo en donde se logre incentivar y promover la compra de música original por medio de la creación de una relación más estrecha entre la compañía y el cliente, en la cual pueda afectar de forma positiva a la comunidad a la que este pertenece. El objetivo general es determinar cuál es la utilidad de los conceptos y estrategias comunitarias en el marketing online para la prevención de la copia ilegal en el mercado musical. Los objetivos específicos son: 1. Mostrar la utilidad de los conceptos y estrategias del marketing comunitario en la prevención de la copia ilegal del mercado musical y 2. Implementar las estrategias logradas en la investigación en un plan de creación de empresa. Se utilizará el método de investigación y análisis de caso, utilizando el plan de empresa en la creación de una empresa del mercado musical, tomando la relación estratégica comunitaria y el marketing dentro del plan de mercadeo como estrategia para la prevención de la copia ilegal. Mediante este proyecto se desea que por medio del marketing relacional y de los conceptos del mercadeo hacia comunidades, enfocado en une- marketing sepuedanestablecerestrategiasparalaprevencióndelacopiailegalydelacomprade estos productos Además, se busca implementar dichos resultados en la empresa que se pretende crear en el sector de la industria musical, puesto que la seguridad que tendrán los productos a la venta, serán la ventaja competitiva de la empresa.

Análisis bibliométrico de depresión infantil

El objetivo de este estudio fue identificar las tendencias en la investigación de la depresión infantil mediante un análisis bibliométrico de artículos publicados entre enero de 2010 y enero de 2015, en las bases de datos EBSCO, Scopus y Scielo. Se incluyeron 146 artículos, escritos en inglés, español y portugués. En el trabajo se identifican los autores más productivos y las tendencias de los autores con respecto al sexo, profesión y producción; así como los países, instituciones y revistas que más publicaron sobre dicho trastorno. La edad y la ansiedad son las variables que con más frecuencia se asocian al tema; de igual forma, se identificó el Children Depression Inventory (CDI) como el instrumento más común para medir la depresión infantil. En este periodo de tiempo destacan los artículos centrados en investigaciones sobre poblaciones con diferentes estados de salud, diseños correlacionales, de corte transversal y escritos por múltiples autores. Al analizar los resultados obtenidos se observa un creciente interés y preocupación de los investigadores por conocer la frecuencia de los trastornos del estado de ánimo y más específicamente de la depresión en niños, y la asociación e influencia que esta puede tener para su desarrollo.

Invprest

Invprest es la primera plataforma de préstamos entre personas en Colombia y Latinoamérica dirigida exclusivamente para Millenials; es decir conectamos a personas que necesitan financiamiento con personas que están dispuestas a prestar a una tasa justa, equitativa y más rentable que la del mercado financiero. Se tiene en cuenta un estudio de crédito diferente al tradicional donde se revisan factores de la personalidad y comportamentales del solicitante de crédito para conocer su riesgo. Actualmente una gran parte de los usuarios financieros se sienten insatisfechos con los servicios que prestan las entidades bancarias. La tecnología y nuevos modelos de economía colaborativa han abierto el espacio a nuevas formas de consumo, entre ellos la innovación en los servicios bancarios que han funcionado por mucho tiempo de la misma forma. La falta de un excelente servicio, unas tasas de interés que no reflejan las condiciones del mercado, la falta de un servicio que incluya las necesidades de los clientes en una economía digital son problemas que se resuelven con este emprendimiento. Se busca llegar a un mercado potencial de 170.000 personas en Bogotá y en Colombia de 638.000 aproximadamente. El mercado en Colombia es nuevo, naciente y con potencial de crecimiento. Actualmente hay más de 70 países que cuentan con plataformas de este estilo y se espera que las inversiones en estos modelos de negocio sean mayores a $14.000 Millones de dólares en el 2.015. Así mismo en Colombia cada vez se conoce más sobre los cambios de la industria financiera mundial. Invprest se diferencia en otros aspectos relacionados con el seguimiento de la cartera, los requerimientos relacionados a la posesión de activos fijos que en este modelo no son necesarios si la persona tiene buenos ingresos y la utilización de firmas electrónicas para que todos los procesos se puedan hacer electrónicamente. Yohan Florez es un apasionado por el tema de finanzas que ha logrado contactar e incluir a personas de Fiduciarias, Brigard & Urrutia, Certicamara y otros expertos financieros en la creación de las soluciones que se le pueden dar a los problemas de este proceso y que ayudan con su conocimiento y experiencia para el desarrollo del proyecto. 3 En el corto plazo la empresa se va a consolidar en Colombia y en el mediano- largo plazo se van a realizar las acciones para expandir el modelo a otros países de Latinoamérica. Se espera que en el tercer año se cuente con ingresos superiores a los $1.700 millones de pesos con una ganancia de $98 millones, el punto de equilibrio se alcanza en el mes 11. El medio para llegar a los clientes es usando redes sociales con publicidad dirigida, así mismo el Ceo será el principal vendedor de la compañía al inicio de la operación. La inversión inicial requerida para el proyecto empresarial es de $201.000.000.

Enhanced fault recovery methods for protected traffic services in GMPLS networks

Les noves tecnologies a la xarxa ens permeten transportar, cada cop més, grans volums d' informació i trànsit de xarxa amb diferents nivells de prioritat. En aquest escenari, on s'ofereix una millor qualitat de servei, les conseqüències d'una fallada en un enllaç o en un node esdevenen més importants. Multiprotocol Lavel Switching (MPLS), juntament amb l'extensió a MPLS generalitzat (GMPLS), proporcionen mecanismes ràpids de recuperació de fallada establint camins, Label Switch Path (LSPs), redundants per ser utilitzats com a camins alternatius. En cas de fallada podrem utilitzar aquests camins per redireccionar el trànsit. El principal objectiu d'aquesta tesi ha estat millorar alguns dels actuals mecanismes de recuperació de fallades MPLS/GMPLS, amb l'objectiu de suportar els requeriments de protecció dels serveis proporcionats per la nova Internet. Per tal de fer aquesta avaluació s'han tingut en compte alguns paràmetres de qualitat de protecció com els temps de recuperació de fallada, les pèrdues de paquets o el consum de recursos. En aquesta tesi presentem una completa revisió i comparació dels principals mètodes de recuperació de fallada basats en MPLS. Aquest anàlisi inclou els mètodes de protecció del camí (backups globals, backups inversos i protecció 1+1), els mètodes de protecció locals i els mètodes de protecció de segments. També s'ha tingut en compte l'extensió d'aquests mecanismes a les xarxes òptiques mitjançant el pla de control proporcionat per GMPLS. En una primera fase d'aquest treball, cada mètode de recuperació de fallades és analitzat sense tenir en compte restriccions de recursos o de topologia. Aquest anàlisi ens dóna una primera classificació dels millors mecanismes de protecció en termes de pèrdues de paquets i temps de recuperació. Aquest primer anàlisi no és aplicable a xarxes reals. Per tal de tenir en compte aquest nou escenari, en una segona fase, s'analitzen els algorismes d'encaminament on sí tindrem en compte aquestes limitacions i restriccions de la xarxa. Es presenten alguns dels principals algorismes d'encaminament amb qualitat de servei i alguna de les principals propostes d'encaminament per xarxes MPLS. La majoria dels actual algorismes d'encaminament no tenen en compte l'establiment de rutes alternatives o utilitzen els mateixos objectius per seleccionar els camins de treball i els de protecció. Per millorar el nivell de protecció introduïm i formalitzem dos nous conceptes: la Probabilitat de fallada de la xarxa i l'Impacte de fallada. Un anàlisi de la xarxa a nivell físic proporciona un primer element per avaluar el nivell de protecció en termes de fiabilitat i disponibilitat de la xarxa. Formalitzem l'impacte d'una fallada, quant a la degradació de la qualitat de servei (en termes de retard i pèrdues de paquets). Expliquem la nostra proposta per reduir la probabilitat de fallada i l'impacte de fallada. Per últim fem una nova definició i classificació dels serveis de xarxa segons els valors requerits de probabilitat de fallada i impacte. Un dels aspectes que destaquem dels resultats d'aquesta tesi és que els mecanismes de protecció global del camí maximitzen la fiabilitat de la xarxa, mentre que les tècniques de protecció local o de segments de xarxa minimitzen l'impacte de fallada. Per tant podem assolir mínim impacte i màxima fiabilitat aplicant protecció local a tota la xarxa, però no és una proposta escalable en termes de consum de recursos. Nosaltres proposem un mecanisme intermig, aplicant protecció de segments combinat amb el nostre model d'avaluació de la probabilitat de fallada. Resumint, aquesta tesi presenta diversos mecanismes per l'anàlisi del nivell de protecció de la xarxa. Els resultats dels models i mecanismes proposats milloren la fiabilitat i minimitzen l'impacte d'una fallada en la xarxa.

Economic models and algorithms for distributed systems

Distributed computing paradigms for sharing resources such as Clouds, Grids, Peer-to-Peer systems, or voluntary computing are becoming increasingly popular. While there are some success stories such as PlanetLab, OneLab, BOINC, BitTorrent, and SETI@home, a widespread use of these technologies for business applications has not yet been achieved. In a business environment, mechanisms are needed to provide incentives to potential users for participating in such networks. These mechanisms may range from simple non-monetary access rights, monetary payments to specific policies for sharing. Although a few models for a framework have been discussed (in the general area of a "Grid Economy"), none of these models has yet been realised in practice. This book attempts to fill this gap by discussing the reasons for such limited take-up and exploring incentive mechanisms for resource sharing in distributed systems. The purpose of this book is to identify research challenges in successfully using and deploying resource sharing strategies in open-source and commercial distributed systems.