Search

Personalized venues recommendation is essential to help people find attractive venue to visit as growth of location-based social networks. Existing approaches never distinguish user individual interests from her social preferences, which leads to a bottleneck of modeling user check-in behaviors accurately. In this paper, we find the differences between user interests and her social preferences clearly and investigate the time law of user check-in behaviors in depth. Consequently, we propose a social-period-aware topic model (SPATM) to learn the influence weights of both user interests and her social preferences on making-decision for each check-in time automatically. Especially, we model latent topic by leveraging smaller size of dynamic activities instead of static categories, which can alleviate the data sparsity problem by using more co-occurrent activities information. Moreover, our approach can automatically judge whether a user's social preference is periodic or aperiodic and learn the periodicity of periodic one. Furthermore, the Alias Sampling based training approach is introduced to improve sampling efficiency. The results demonstrate our proposed model is effective and outperforms the state-of-the-art approaches in terms of effectiveness and efficiency. Besides, SPATM can learn semantically coherent latent topics and geographically dispersed latent social topics which are useful to explain recommendation.

High-resolution continuous-time delta-sigma modulators use resistive feedback DACs for low-noise operation. Such DACs have conventionally been switched at the reference end. It turns out that reference-path resistance degrades the performance of these DACs. This problem can be addressed by the virtual-ground-switched resistor DAC. However, moving the switches to the virtual-ground-side degrades alias-rejection of the modulator. This brief analyzes the mechanism of degradation and develops a model to estimate alias rejection. Our theory is supported by simulations and measurements from a prototype modulator designed in a 180 nm CMOS process. We then describe a way to address this problem, and demonstrate its efficacy using layout-extracted simulations.

A raíz de la fusión de Tiendeo con Shopfully, nace la necesidad de crear una metodología de trabajo para poder definir las pautas y procedimientos para poder realizar una migración de dominio exitosa, unificando los dominios de Tiendeo y Shopfully. Para ello, se analizarán las aplicaciones que puedan verse afectadas por dicho cambio y se recreará el escenario que está en producción actualmente para realizar las pruebas pertinentes. Este sandbox está compuesto por Google Workspace, Slack, Jira y Onelogin. Para finalizar se crearán/modificarán los scripts de las aplicaciones necesarias para automatizar al máximo el proceso. As a result of the Tiendeo-Shopfully merger, the need arises to create a work methodology to be able to define the guidelines and procedures to carry out a successful domain migration, unifying the domains of both companies. To do this, the applications that may be affected by these changes will be analyzed and the scenario that is currently in production will be recreated to carry out the relevant tests. This sandbox is composed of Google Workspace, Slack, Jira and Onelogin. To finish, the scripts of the applications necessary to automate the process as much as possible will be created/modified.

The Sabah state assembly was dissolved on 30 July 2020 by the Chief Minister Shafie Apdal to prevent a coup by the previous Chief Minister Musa Aman through his “Group 33”. The 2020 Sabah State election was held on 26 September 2020 involved a record total of 447 candidates vying for 73 state seats. The main contest was between the WARISAN-PLUS of 5 political parties and a group of 9 political parties under the coalition of the newly minted Gabungan Rakyat Sabah (GRS). GRS managed to wrest the state government by comfortably winning 38 out of 73 seats with additional 3 seat came from pro-GRS independent candidates. Nevertheless, WARISAN managed to retain N53 Sekong even as the incumbent have been dropped after 26 months at the helm. This article studied on issues surrounding the victory of Alias Haji Sani during the election. The findings of this articles uses primary data, secondary data, online sources dan participative observation findings. The victory of Alias Haji Sani shows that the influence of people-centric and “Gentlemen Politics Budiman” identification is stronger than political affiliation.

Postmodern fiction demonstrates a suspicion about the narrative status of history. Arguably, its project is to reveal the illusion of truth in history because of history's reliance on texts. There is no doubt that historical events occur, but their transmutation into “fact” and their transmission to posterity are limited by their narrativization and textualization. In the Afterword to her novel, Alias Grace (1996) – a fictionalized narrative centering on a real-life person embroiled in a double murder in 1843 – Margaret Atwood reveals her interest in this problem with “history”. She tells the reader, “I have of course fictionalized historical events … as did many commentators on this case who claimed to be writing history”. The purpose of this paper is thus to consider Margaret Atwood’s novel, Alias Grace as a postmodern fiction that seeks to reveal the illusion of truth in history through her use of innovatory narrative techniques. Mikhail Bakhtin’s notion of the “double-voiced” is used to examine the permitted, surface-level utterances – and the necessarily conflicting actual narratives – of the two narrators in Atwood’s novel. However, the term is also applied in the broader feminist/theoretical context of the silencing of the female subject more generally. Atwood establishes a fragmented, multiplicity narrative. This arises from the reported and somewhat self-aware observations of the eponymous Grace and a doctor named Simon Jordan. Seemingly, the author’s own authority does not exist. Atwood thus exploits the slippery nature of language that does not have some kind of “truth” imposed upon it. The historical “truth” about Grace Marks is never revealed, not because Atwood is “leaving it to the reader's imagination” but because Atwood plays with the problem of personality as a social construction. Almost invisible as “author”, Atwood nevertheless reveals just how language can be manipulated and made to conform to a certain version of ‘truth’ and ‘reality’. However, in Alias Grace, Atwood also recuperates the voice of a supposedly murderous woman by revising the myth of woman’s silence and subjugation. Because her speaking voices are required to practice “double-voicing” to be heard, through presenting the reader with both voices, Atwood recuperates the moments of existential liberation to be heard from emergent voices.

Traditional context-sensitive pointer analysis is hard to scale for large and complex Java programs. To address this issue, a series of selective context-sensitivity approaches have been proposed and exhibit promising results. In this work, we move one step further towards producing highly-precise pointer analyses for hard-to-analyze Java programs by presenting the Unity-Relay framework, which takes selective context sensitivity to the next level. Briefly, Unity-Relay is a one-two punch: given a set of different selective context-sensitivity approaches, say S = S1, . . . , Sn, Unity-Relay first provides a mechanism (called Unity)to combine and maximize the precision of all components of S. When Unity fails to scale, Unity-Relay offers a scheme (called Relay) to pass and accumulate the precision from one approach Si in S to the next, Si+1, leading to an analysis that is more precise than all approaches in S. As a proof-of-concept, we instantiate Unity-Relay into a tool called Baton and extensively evaluate it on a set of hard-to-analyze Java programs, using general precision metrics and popular clients. Compared with the state of the art, Baton achieves the best precision for all metrics and clients for all evaluated programs. The difference in precision is often dramatic — up to 71% of alias pairs reported by previously-best algorithms are found to be spurious and eliminated.

In 1771 and 1772 Alonso Carrió de la Vandera (1715?-1783) made an extensive trip to describe and evaluate the path of posts between Buenos Aires and Lima. His multifaceted journey was narrated in detail in El lazarillo de ciegos caminantes, a text that presents a scriptural awareness and an unusual plot development for its context. In this article we will deal in particular with the construction of an apocryphal author, Don Calixto Bustamante Carlos Inca, alias Concolorcorvo, to reflect on the problem of the attribution of the speeches and the proper name, and the condition of existence of the subject who signs and of the empirical author, since we affirm that Carrió de la Vandera becomes a paper being by entering the fictions he erects and interrelating on the same diegetic level with his creations.

Headstega (Head steganography) is a noiseless steganography that used email headers as a cover for concealing messages. However, it has less embedding capacity and it raises suspicion. For overcoming the problem, bitwise operation is proposed. In the proposed method, the message was embedded into the cover by converting the message and the cover into binary representation based on a mapping table that was already known by the sender and the receiver. Furthermore, XOR bitwise operations were applied to the secret message and cover bits based on random numbers that were generated using a modular function. Moreover, the result was converted into characters that represent the secret message bits. After embedding the message into the cover, an email alias was generated to camouflage the secret message characters. Finally, the sender sends the embedded cover and the email alias to the recipient. Using the proposed method, the embedding capacity is 89% larger than using the original Headstega. For reducing the adversary’s suspicion, the existing email address was used instead of creating a new email address.

In this paper we present two-stage CIC (cascaded-integrator-comb) decimation filters with decimation factor M expressed as M = M1M2, where M 1 , M 2 ∈ Z + . The proposed decimator-I aims to minimize the pass-band droop using a cascade connection of Kaiser Hamming (KH) and Saramaki-Ritoniemi (SR) sharpening structures. The coefficients of second stage are determined using linear programming in MATLAB. The proposed CIC decimator-I when designed for various integer decimation factors on an average has a pass-band droop of −0.09 dB at the normalized frequency of 1/2 M and an average alias rejection of −44 dB at the normalized frequency of 3/2 M. Further, another decimator-II structure extends decimator-I to achieve an alias rejection of −87 dB and pass-band droop of −0.17 dB. The FPGA implementation of proposed designs has lower slice utilization and achieves higher maximum operating frequency than other existing competing designs. The performance of proposed decimation filters is confirmed using computer simulations in analog-to-digital converters (ADC) and sigma-delta (ΣΔ) modulators.

In this work, using the weighted symmetric functions $$\sigma _{k}^{\infty }$$ σ k ∞ and the weighted Newton transformations $$T_{k}^{\infty }$$ T k ∞ introduced by Case (Alias et al. Proc Edinb Math Soc 46(02):465–488, 2003), we derive some generalized integral formulae for close hypersurfaces in weighted manifolds. We also give some examples and applications of these formulae.

In recent years, blockchains systems have seen massive adoption in retail and enterprise environments. Cryptocurrencies become more widely adopted, and many online businesses have decided to add the most popular ones, like Bitcoin or Ethereum, next to Visa or Mastercard payments. Due to the decentralized nature of blockchain-based systems, there is no possible way to revert confirmed transactions. It may result in losses caused by human error or poor design of the user interface. We created a cryptocurrency wallet with a full on-chain solution for aliasing accounts and tokens to improve user experience and avoid unnecessary errors. The aliasing system consists of a number of smart contracts deployed on top of the blockchain network that give the ability to register aliases to accounts and tokens and use them instead of opaque addresses. Our solution shows how performant modern blockchains are and presents a way of building fully decentralized applications that can compete with centralized ones in terms of performance.

A fascinating factor of so-called mass culture is the ability to adapt to society and its needs. The same pattern seems to be followed by the film industry, as it has been influenced by other branches of entertainment, television included. These are SVODs (Streaming Video on Demand platforms), which offer a growing number of screen adaptations of literary works. The following paper aims to analyse some criteria upon which book-to-series adaptations might be regarded as successful, using examples from The Handmaid’s Tale and Alias Grace.Produced respectively by Hulu and CBC, both based on books by the Canadian female writer Margaret Atwood, the analysed shows confirm that the audience is more inclined to watch (and read) an intertextual production that often reflects and comments on contemporary political and social reality.

Data races have become one of the severe issues affecting the correctness of concurrent programs. Existing detection tools for data races have many false positives and false negatives. To improve the correctness, this paper proposes a context-sensitive approach to detect data races in concurrent programs. Several program analysis techniques are conducted to reduce false positives and false negatives. First, control-flow analysis is used to construct call graphs, in which escape analysis is employed to find escaped objects among threads. Second, context-sensitive alias analysis is employed to find alias objects. Finally, happens-before analysis is conducted to reduce false positives and false negatives. We develop a prototype tool ConRacer based on WALA and evaluate it on several benchmarks. We also compare ConRacer with existing static and dynamic tools. The experimental results show that ConRacer can effectively detect data races and reduce false positives and false negatives.

The present paper examines the topic of aliases of criminals, which seems to be understudied in linguistic research. Therefore, this article’s primary goal is to describe how criminals’ aliases are created and what are the differences and similarities in that process in English, French, and Polish. Firstly, the theoretical background concerning the topic of pseudonyms is presented. Then, the corpus gathered for this paper (available online: https://cutt.ly/1TRefrK), consisting of 206 pseudonyms (123 units in English, 42 in French, and 41 in Polish), is analyzed. In the analysis, four schemes are noted to be the most commonly used in creating pseudonyms of criminals. What ismore, the inspirations behind the creation of criminals’ pseudonyms are scrutinized, and nine typical inspirationsare distinguished. The article constitutes not only a detailed linguistic analysis of a significant number of criminals’aliases but can also serve as an inspiration for other research on the topic.

Nowadays personal names are not the only way to refer to celebrities and experts from different fields, instead, they can be referred to by their aliases on the web. Associated aliases have remarkable importance in retrieving information about the personal name from the websites. Therefore, disclosing aliases can have an important role in overcoming many real-world challenges. In this research, the aim is to explore and propose a reliable algorithm that can detect aliases that occurred due to transliteration of Arabic names into English. An extension to the Enhanced N-gram distance algorithm (E-N-DIST) which was previously published is introduced in this paper. The proposed algorithm is called the Extended Enhanced N-gram distance algorithm (E-E-N-DIST). The differences between E-N-DIST and E-E-N-DIST are two main changes in calculating the cost of substitution and transposition. First, E-E-N-DIST is computed based on 2n+1 - 1 states. The second is the use of an edit operation called the 'Exchange of Vowels' to count the common spelling errors that happen due to the transliteration from one language to another. The idea of exchange of vowels is to search for vowels (viz. = a`, = e`, = i', = o`, and = u`) and the non-vowel character = y` that has a vowel sound or a part of it in other languages to estimate the operations cost of insertion and deletion. The proposed algorithm tested using a dataset for the literature; the results obtained are compared with other algorithms from the state of the art. The proposed algorithm outperforms other algorithms; it achieved a better average percentage of similarity than all other compared algorithms.

Solving the deadlocks avoidance problem in Resource Allocation Systems (RAS) in Discrete-Event Systems (DES) is a rife problem, especially in Flexible Manufacturing Systems (FMS), alias Automated Manufacturing Systems (AMS). Petri Nets (PN) are an effectual tool often used at this procedure. In principle, there are two basic approaches how to deal with deadlocks in RAS based on PN. They are listed and illustrated here. First of the approaches is realized by means of the supervisor based on P-invariants of PN, while the second one is realized by means of the supervisor based on PN siphons. While the first approach needs to know the reachability graph/tree (RG/RT) expressing the causality of the development of the PN model of RAS, in order to find (after its thorough analysis) the deadlocks, the second approach needs the thorough analysis of the PN model structure by means of finding siphons and traps. Next, both approaches will be applied on the same PN model of RAS and the effectiveness of the achievement of their results will be compared and evaluated. Several simple illustrative examples will be introduced. For the in-depth analysis of the problem of deadlock avoiding, next Part 2 of this paper is prepared, where the newest research will be introduced and illustrated on more complicated examples. If necessary (because of the limited length of particular papers), also the third part – Part 3, will be prepared.

In a note published in this journal in 2019, Sebastian Sobecki drew attention to a new life-record for John Lydgate. The document, which dates to late January or early February 1425, is of significance because it offers the earliest surviving record of Lydgate's tenure as prior of Hatfield Regis. However, the record only refers to him as “John, prior of Hatfield Regis.” Here the author would like to present three new life-records from 1424, all of which mention Lydgate by name and identify him as prior of Hatfield Regis, therefore pushing back the evidence for his time as prior by a calendar year.

Global IPv6 scanning has always been a challenge for researchers because of the limited network speed and computational power. Target generation algorithms are recently proposed to overcome the problem for Internet assessments by predicting a candidate set to scan. However, IPv6 custom address configuration emerges diverse addressing patterns discouraging algorithmic inference. Widespread IPv6 alias could also mislead the algorithm to discover aliased regions rather than valid host targets. In this paper, we introduce 6GAN, a novel architecture built with Generative Adversarial Net (GAN) and reinforcement learning for multi-pattern target generation. 6GAN forces multiple generators to train with a multi-class discriminator and an alias detector to generate non-aliased active targets with different addressing pattern types. The rewards from the discriminator and the alias detector help supervise the address sequence decision-making process. After adversarial training, 6GAN's generators could keep a strong imitating ability for each pattern and 6GAN's discriminator obtains outstanding pattern discrimination ability with a 0.966 accuracy. Experiments indicate that our work outperformed the state-of-the-art target generation algorithms by reaching a higher-quality candidate set., The paper has been accepted at the 2021 IEEE International Conference on Computer Communications (INFOCOM 2021). The source code has been published at https://github.com/CuiTianyu961030/6GAN

Regarding Michael Servetus alias Reves, Villanovanus, or de Villeneufve, it is known with certainty that he was burnt at the stake, under a sentence from the Calvinist Geneva Council, on 27 October...

In this paper, we propose an efficient two-stage decimator structure based on Kaiser Hamming sharpening (KHS) of moving average filter. The proposed KHS decimator divides the overall decimation factor $$M = M_1M_2$$ , such that both $$M_1, M_2 \in {\mathbb {Z}}^+$$ . The first stage uses KHS with first and second order of tangency at unity and zero, respectively. The second stage uses the simplest KHS sharpening, i.e. first-order tangency at both unity and zero. The architecture of the proposed structure is designed to match the existing decimator to have nearly equal number of integrator sections operating at high sampling frequency of $$f_\mathrm{s}$$ . The pass-band droop at the normalized pass-band cut-off frequency of 1/2M in the proposed design is $$13.8\%$$ less as compared to the existing KHS decimator, with a compromise of $$3\%$$ in alias rejection. Further, as the normalized pass-band cut-off frequency is reduced to 1/4M, the proposed design in comparison to existing decimator has $$34.5\%$$ less droop with only $$2.3\%$$ compromise in alias rejection.

We set out to explore how best to mitigate the number of period aliases for a transiting TESS system with two identified transits separated by a large time period on the order of years. We simulate a realistic population of doubly transiting planets based on the observing strategy of the TESS primary and extended missions. We next simulate additional observations using photometry (NGTS) and spectroscopy (HARPS and CORALIE) and assess its impact on the period aliases of systems with two TESS transits. We find that TESS will detect around 400 exoplanets that exhibit one transit in each of the primary and extended missions. Based on the temporal coverage, each of these systems will have an average of 38 period aliases. We find that, assuming a combination of NGTS and CORALIE over observing campaigns spanning 50 days, we can find the true alias, and thus solve the period, for up to 207 of these systems with even more being solved if the observing campaigns are extended or we upgrade to HARPS over CORALIE., 11 pages, 8 figures. Accepted for publication in MNRAS

This article describes a software tool, named Dactylo, which is capable of performing metrical analysis, alias scansion, of epics written in hexameter. The automated scansion is based on well-known scanning rules of various theoretical works. The development methodology introduces the concept of computerized metric profiling and metric distance, which is a measurement value that reflects the degree of similarity or dissimilarity between different epics. For this purpose, eight renowned epics have been scanned, including Iliad and Odyssey, with plenty of statistical information. Based on these outcomes, these epics can be classified in groups that reflect very well the three periods of their creation, namely Classical, Hellenistic and Late Antiquity. Dactylo demonstrates its ability to produce statistics for hexameter’s metric patterns in a massive scale, easily and accurately, becoming so a contribution of Computational Linguistics to the diachronic comparative and quantitative language studies.

The problem of the identity of the woman hiding her gender under a male pseudonym makes us recollect U. Eco’s arguments about the truth and the purpose of literature as well as A. F. Losev’s ideas about the name and the meaning, the theories of the feminist literary critics K. Millett, M. Ellman, T. Moi, E. Showalter, etc. who have presented "women`s writing" and "writing about women" in the feminist field. As one of the central principles of feminist criticism is that no scientific view can ever be neutral, the problem of pseudonyms occupies an important place in the contemporary gender studies, explicitly or implicitly highlighting the artificially constructed debate, which divides "serious male literature" and "superficial and secondary female writing". On the one hand, this is the problem of feminism itself, on the other, it is a question of the role and place of the woman in the world` culture and history. In this kind of the analysis we cannot ignore such an epiphenomenon of postmodernism as "label change" with the postmodern emphasis on the sociocultural role of the context, which is especially relevant in aspects of the gender "name problem". The last one, undoubtedly, is included in the problematization of postmodern culture on the whole, since all cultural narratives have always been gender "stories". Today an individual construct his or her gender-reflecting reality, still the modelling of the new gender system is far from being complete. The created sign systems are ambivalent, the meanings are very unstable and can easily be hermeneutically interpreted. However, the role of hermeneutics in analyzing the relationship between the author and the sociocultural context is in the core of the gender aspects of literature, in general, and in the problems of the pseudonym as a change of "name", in particular. The latter is by all means relevant and important. Undoubtedly, one of the main incentives for feminist scholars in their turn to women's literature is connected with the patriarchal demand for women's "silence", their "dumbness" in culture and, accordingly, in literature. Obviously, there are two main interpretations of the concept of "female literature" in feminist criticism. The first one is the representation of female subjectivity in its difference from the male one. The second approach is the representation of "non-essentialist" female subjectivity, which is understood as the logical structure of the difference. In general, in the patriarchal dichotomy of the femininity and masculinity "women who write" are always dangerous. "Three strange sisters" – Anne, Charlotte and Emily Bronte wrote their novels under disguise of male pen names, exactly specifying two conceptual motives: the "Other" concept and the image of "Veil". In this context the motive of androgyny is also important from the point of view of both analysis and literary criticism. In ХIXth century George Sand (Aurora Dupin), having most vividly represented this concept, became an example for many subsequent generations of feminists – writers, actresses and media representatives. However, in our era of gender plurality, the question of the pseudonym as a problem of "genders" is not so relevant; more likely it is still a question of the priorities in the feminist theory. In the contemporary discourse of literary criticism many of the author’s socially significant features are perceived as gender neutral. In the postmodern paradigm the question of the androgynous identity of the man/woman writer requires its further actualization as the androgynous is often replaced by the bisexuality (J. Irving` "In One Person"). In general, it should be recognized that postmodern approaches to gender identity, which paint a "picture of the world" today, transform the female experience of being as the "Other", secondary and insignificant with a conceptual orientation to a fundamental variety of postmodern cognitive perspectives.

In the retrieval and mining of traditional Chinese medicine (TCM) patents, a key step is Chinese word segmentation and named entity recognition. However, the alias phenomenon of traditional Chinese medicines causes great challenges to Chinese word segmentation and named entity recognition in TCM patents, which directly affects the effect of patent mining. Because of the lack of a comprehensive Chinese herbal medicine name thesaurus, traditional thesaurus-based Chinese word segmentation and named entity recognition are not suitable for medicine identification in TCM patents. In view of the present situation, using the language characteristics and structural characteristics of TCM patent texts, a modified and serialized co-training method to recognize medicine names from TCM patent abstract texts is proposed. Experiments show that this method can maintain high accuracy under relatively low time complexity. In addition, this method can also be expanded to the recognition of other named entities in TCM patents, such as disease names, preparation methods, and so on.

There is more than a decade-long history of using static analysis to find bugs in systems such as Linux. Most of the existing static analyses developed for these systems are simple checkers that find bugs based on pattern matching. Despite the presence of many sophisticated interprocedural analyses, few of them have been employed to improve checkers for systems code due to their complex implementations and poor scalability. In this article, we revisit the scalability problem of interprocedural static analysis from a “Big Data” perspective. That is, we turn sophisticated code analysis into Big Data analytics and leverage novel data processing techniques to solve this traditional programming language problem. We propose Graspan , a disk-based parallel graph system that uses an edge-pair centric computation model to compute dynamic transitive closures on very large program graphs. We develop two backends for Graspan, namely, Graspan-C running on CPUs and Graspan-G on GPUs, and present their designs in the article. Graspan-C can analyze large-scale systems code on any commodity PC, while, if GPUs are available, Graspan-G can be readily used to achieve orders of magnitude speedup by harnessing a GPU’s massive parallelism. We have implemented fully context-sensitive pointer/alias and dataflow analyses on Graspan. An evaluation of these analyses on large codebases written in multiple languages such as Linux and Apache Hadoop demonstrates that their Graspan implementations are language-independent, scale to millions of lines of code, and are much simpler than their original implementations. Moreover, we show that these analyses can be used to uncover many real-world bugs in large-scale systems code.

A continuing mystery in understanding the empirical success of deep neural networks is their ability to achieve zero training error and generalize well, even when the training data is noisy and there are more parameters than data points. We investigate this overparameterized regime in linear regression, where all solutions that minimize training error interpolate the data, including noise. We characterize the fundamental generalization (mean-squared) error of any interpolating solution in the presence of noise, and show that this error decays to zero with the number of features. Thus, overparameterization can be explicitly beneficial in ensuring harmless interpolation of noise. We discuss two root causes for poor generalization that are complementary in nature -- signal "bleeding" into a large number of alias features, and overfitting of noise by parsimonious feature selectors. For the sparse linear model with noise, we provide a hybrid interpolating scheme that mitigates both these issues and achieves order-optimal MSE over all possible interpolating solutions., 52 pages, expanded version of the paper presented at ITA in San Diego in Feb 2019, ISIT in Paris in July 2019, at Simons in July, and as a plenary at ITW in Visby in August 2019

Dewasa ini perkembangan teknologi mempengaruhi berbagai aspek dalam kehidupan, termasuk dalam melakukan transaksi finansial. Di kampus Universitas Advent Indonesia, pembayaran masih menggunakan cara konvensional alias menggunakan uang kertas untuk pembayaran. Sehingga memungkinkan terjadinya kesalahan dalam pembayaran, maupun pengguna tidak bisa melacak history pembayaran yang dilakukan. Aplikasi yang dibangun diharapkan dapat menjadi alternative pembayaran di kampus. Aplikasi yang dibangun berdasarkan Analisa kebutuhan terhadap sistem lama, dan dibangun menggunakan Android dengan backend berbasis PHP. Proses pembayaran menggunakan validasi QR Code, baik untuk melakukan transaksi antar penjual dengan pengguna, maupun sesama pengguna. Hasil dari penelitian adalah sebuah aplikasi pembayaran berbasis QR Code yang dapat berjalan dengan baik dan teruji secara fungsional dan tampilannya.

Online transportation services are transportation services that take advantage of advances in information technology. In Indonesia, several online transportation service providers have grown, such as Gojek, Grab and several other startup startups. In addition to the many benefits and conveniences that have been provided, the service price factor is still felt expensive for the community, especially the lower classes. One solution is to build a Collaborative Transportation Application that utilizes the Collaborative Transportation Management (CTM) interaction method. The main features contained in the application, namely the feature of finding driver routes in the direction of the consumer route, online chat, and route management by utilizing the Android mobile application based on Google Map API and Firebase Cloud Messaging. Performance testing using JMeter from a total of 300 virtual users performs 6 HTTP requests resulting in an average response time of 0.852 alias tolerated according to Apdex standards. Based on the results of testing of 15 respondents obtained the results that this application is easy to use, supports traveling activities, fast response time when used, features provided are quite complete, an accurate position tracking system, unidirectional route search is very compatible with consumer routes, and the process of coordination and driver collaboration is very good so that the travel costs borne by consumers become more economical.., Jasa transportasi online merupakan jasa transportasi yang memanfaatkan kemajuan teknologi informasi. Di Indonesia, telah tumbuh beberapa penyedia jasa transportasi online seperti Gojek, Grab dan beberapa startup rintisan lainnya. Di samping banyak manfaat dan kemudahan yang telah diberikan, faktor harga layanan masih dirasakan mahal bagi masyarakat terutama kelas bawah. Salah satu solusinya adalah dengan membangun Aplikasi Transportasi Kolaboratif yang memanfaatkan metode interaksi Collaborative Transportation Management (CTM). Fitur utama yang terdapat pada aplikasi, yaitu fitur mencari rute pengemudi-pengemudi yang searah dengan rute konsumen, obrolan daring, dan manajemen rute dengan memanfaatkan aplikasi mobile Android berbasis Google Map API dan Firebase Cloud Messaging. Pengujian performance testing menggunakan JMeter dari total 300 virtual users melakukan 6 HTTP request menghasilkan waktu respon rata-rata 0.852 alias tolerated sesuai standar Apdex. Berdasarkan hasil pengujian terhadap 15 reponden diperoleh hasil bahwa aplikasi ini mudah digunakan, mendukung aktivitas bepergian, waktu respon yang cepat ketika digunakan, fitur yang disediakan cukup lengkap, sistem posisi pelacakan yang akurat, pencarian rute searah sangat cocok dengan rute konsumen, serta proses koordinasi dan kolaborasi pengemudi-pengemudi sangat baik sehingga tarif perjalanan yang ditanggung konsumen menjadi lebih ekonomis.