officially granted conditional Investigational Device Exemption (IDE) approval for its F2 cerebral embolic protection system. Key Market Players Filterlex Medical Ltd., Emboline, Inc., Venus MedTech HangZhou Inc., Boston Scientific Corporation ...

TAVR Embolic Protection Market

Mizuho Securities analyst Anthony Petrone maintained a Hold rating on Boston Scientific (BSX – Research Report) on October 27 and set a

Neutral Outlook on Boston Scientific Amid Strong Q3 Performance and Uncertain 2024 Factors

Operator: Good day, and welcome to the Boston Scientific Third Quarter 2023 Earnings Conference Call. All participants will be in listen-only mode.

Boston Scientific Corporation (NYSE:BSX) Q3 2023 Earnings Call Transcript

The Marlborough, Massachusetts-based company presented its results at the Transcatheter Cardiovascular Therapeutics (TCT) meeting. Data demonstrated statistical superiority for Agent compared to uncoated balloon angioplasty.

Boston Scientific shares positive drug-coated balloon data

Boston Scientific Corp (NYSE: BSX) generated Q3 revenues of $3.53 billion, beating the Wall Street estimate of $3.48 billion.

Medical Devices Provider Boston Scientific Cardiovascular Segment Sees Traction In Q3, Company Adjusts Annual Outlook

For the current quarter ending in December, Boston Scientific expects its per-share earnings to range from 49 cents to 52 cents. The company expects full-year earnings in the range of $1.99 to $2.02 per share.

Boston Scientific: Q3 Earnings Snapshot

Boston Scientific raised its annual profit forecast on Thursday, banking on strong demand for heart devices including its stroke prevention product, Watchman, and a recovery in demand for elective surgeries.

Boston Scientific lifts earnings forecast on solid demand for heart devices

A steady recovery in non-urgent surgical procedures such as hip and knee replacements, which were postponed during the pandemic, and easing staffing shortages at hospitals have boosted demand for medical devices.

Boston Scientific raises profit forecast on strength in heart devices unit

Nairobi — Chinese disposable medical device maker and seller Zhende Medical says that it will build a factory in Tatu City, the 5,000-acre Special Economic Zone (SEZ) in Ruiru, Kiambu County.

Kenya: China's Zhende Medical to Build Medical Devices Factory At Tatu City

As technology advances, physicians must learn and master newly innovated devices. By providing ... 6 This is why Boston Scientific and the Urology Care Foundation created the Boston Scientific Medical Student Innovation Fellowship Award, which supports ...

Q&A With Dr. Ronald A. Morton, Chief Medical Officer, Urology, Boston Scientific

Get the most recent info and news about Boston Scientific on HackerNoon, where 10k+ technologists publish stories for 4M+ monthly readers.

Boston Scientific Corporation develops, manufactures, and markets medical devices for use in various interventional medical specialties worldwide. It operates through three segments: MedSurg, Rhythm and Neuro, and Cardiovascular. The company offers devices to diagnose and treat gastrointestinal and pulmonary conditions; devices to treat various urological and pelvic conditions; implantable cardioverter and implantable cardiac resynchronization therapy defibrillators; pacemakers and implantable cardiac resynchronization therapy pacemakers; and remote patient management systems. It also provides medical technologies to diagnose and treat rate and rhythm disorders of the heart comprising 3-D cardiac mapping and navigation solutions, ablation catheters, diagnostic catheters, mapping catheters, intracardiac ultrasound catheters, delivery sheaths, and other accessories; spinal cord stimulator systems for the management of chronic pain; indirect decompression systems; and deep brain stimulation systems. In addition, the company offers interventional cardiology products, including drug-eluting coronary stent systems used in the treatment of coronary artery disease; percutaneous coronary interventions products to treat atherosclerosis; intravascular catheter-directed ultrasound imaging catheters, fractional flow reserve devices, and systems for use in coronary arteries and heart chambers, as well as various peripheral vessels; and structural heart therapies. Further, it provides stents, balloon catheters, wires, atherectomy systems to treat arterial diseases; thrombectomy and acoustic pulse thrombolysis systems, wires, and stents to treat venous diseases; and peripheral embolization devices, radioactive microspheres, ablation systems, and micro and drainage catheters to treat cancer. The company was founded in 1979 and is headquartered in Marlborough, Massachusetts.

Boston Scientific

Last year my wife and I were struggling grad students, and to top it off, I’d lost my Visa sponsorship and we had a baby on the way. Thanks to the STARTUP class at The University of Minnesota, our business savvy, and a great group of mentors, it’s a year later and we are an emerging recruiting startup , alumni of San Francisco’s Founder’s Space, with a small, dedicated team, and a full launch coming this year. This is our story, and the story of our app, Rakuna . From the first days of my career I knew there was a problem with recruiting. While working for Boston Scientific as a project manager, I co-developed a recruiting app for the iPad and won the Mobile Hackathon competition.I eventually left that project behind to pursue my Masters in Medical Devices Innovation at the University of Minnesota, but it wasn’t long until crafting a solution to recruitment’s problems consumed me once again. January of 2015 was a tough time for my wife, Ngan, and I. When I quit my job in Boston I lost Visa sponsorship, and to pursue our goals we would wind up selling everything from our car, to the television, to old clothes. For a time, I slept on the floor in a sleeping bag, commuted on a bicycle, and we didn’t have health insurance for months while Ngan was pregnant. business Cozy bedroom She pulled me into the STARTUP class, a course that empowers students to reach potential customers and refine their business idea. We reached out to an interviewed over 30 campus recruiters and 70 students and confronted one of the biggest issues in present day recruiting: the disconnect between offline and online experiences. We knew we were on to something when after talking to over 35 recruiters from 30 companies, more than 50% claimed there was no good solution out there that addressed this problem. A majority explicitly asked for a campus-specific tool, and we were quickly inundated with emails and calls from companies (some very large companies, like Best Buy), asking for solutions. The dissatisfaction went both ways, students reported feeling as if they were falling into a black hole of resumes, without a personal connection to potential employers. It was from these conversations we began conceiving our own idea for a startup: a product that would make the campus recruiting process easier, more personal, and more effective. We came up with the name, , which means in Japanese. Rakuna effortless Our idea was good, the market was responding before they’d even seen a prototype, which only encouraged us to put our noses to the grindstone and make something viable. The lessons of our Lean Startup class were crucial here, our idea wasn’t necessarily original, it was born from market demand, and we try to stay lean by validating our ideas through customer development process. Final deliverables for Minnesota Cup 2015 Less than two months later we had a prototype and entered the Minnesota cup, the largest statewide business competition in the country. 1,300+ companies competed in 2015. We were confident from Day One, but entered the competition in the spirit of learning and testing the water. Soon we were in the semi-final round, the top 60 companies, and brought two new mentors on board — HR industry veteran, former CEO of Jobs2Web, and current Director at Virteva — Ken Holec, and Rick Brimacomb, a venture capitalist turned early-stage startup advisor. Founder Brimacomb and Associates. I still remember Rick’s feedback vividly: “Trong I’ve seen a lot of business plans and slide decks that are mediocre, and you know what? The way to stand out is to make it look like hollywood branding. You want a Hollywood cover, well designed, visually appealing, and with a great story to connect audience emotionally.” We took all of their advice to heart and advanced to the final round: the top 18 out of 1,300+ companies. I remember my pitch that day very well. I’d practiced it dozens of times, and gone over every detail with our advisors — I was ready, but there was something I felt I needed to disclose to the judges. “As of this morning,” I said. “We learned we have an opportunity to go to one of top incubators in San Francisco and we think that’s where we should go.” The judges were cordial and thanked me for my honesty, but reminded me that this was still the Minnesota cup, meant to support Minnesota business. I understood their point, and we walked away with 3rd place in our category, and regardless of our place, the experience and connections made at the Minnesota Cup were incredible. An inspiring founder’s story It was time to head to San Francisco, and to , but I took my time, stopping in every National Park between Minnesota and the Bay Area to take photographs and decompress. One morning in the Badlands I got a call from Steve Klick, a judge from the Minnesota Cup and entrepreneur who turned his mother’s entire life savings into a successful exit. We had a great talk about business, work ethic, and vision, and I was humbled and thrilled to hear to that he was interested in offering us some funding. Founder’s Space With Steve’s help, and the lessons learned at Minnesota Cup, we were able to get our first true MVP (minimum viable product) up and running. While our time at integrated us into the Silicon Valley ecosystem, and taught us how to bring a product to market, the first thing we did was take it back to Minnesota. We wanted to test Rakuna out at career fairs and recruiting events. It was just an MVP, but we were a hit. One company executive walked me around an event, introducing me to other companies, and I realized we weren’t just creating customers, we were creating advocates. Founder’s Space I’m tremendously proud of Rakuna, what we’ve accomplished so far, and I can’t wait for the future. And at the end of the day there’s one thing that truly set us apart: The product gives recruiters the ability to have 100% engagement experience with a candidate. Think about the current solution, paper and pens? iPad kiosk stations? You send recruiters & staff to a campus to build relationships and get top leads. The worst experience is wasting a quality candidate’s time having them fill out paperwork, or type on a tablet. We simplify, we put it in the device you already have, so it will fit in the conversation with the candidate, and it happens naturally. While they exchange information they have the app at their fingertips to capture the information. That’s a 100% engagement experience, you don’t see it in any other solution. Now, our focus is on making the mobile app (iOS) and web app ready for mass market. We’re building our team, and working hard through our sales cycle to acquire customers and prepare for a full launch this September. The journey from idea, to product, to business is a long one. It requires patience, hard work, and dedication, but it is also among the most rewarding things I’ve ever done. But there are a couple things about growing a startup, about translating an idea into practice that don’t get discussed enough: luck, and gratitude. I would never take away from our vision or our work, but we feel so lucky to have met the advisors, mentors, and investors that we’ve had the chance to work with, we feel so lucky to have come from a Minnesota ecosystem that was so supportive and conducive to new ideas, and we’re lucky that we get to work on something that means so much to us everyday. In that same vein we are thankful — thankful for the great minds that have mentored us and supported us, thankful for the communities that have welcomed us and rooted for us even when we have moved on or changed locations, because when it’s all said and done, anyone can have a great idea, but it takes a team to make ideas reality. So to everyone that’s helped us along the way, that continues to support us, or plans on helping us in the future: Thank You!

From The Classroom to The Valley

A Roadmap for Addressing Critical Challenges in Human-Machine Social Systems

Could Science Benefit From AI-mediated Communication? This Study Says it Could

AI Consciousness is Inevitable: A Theoretical Computer Science Perspective: References

Controlling Automated Vehicles on Large Lane-free Roundabouts (Extended Version): References

Unlocking the Secrets of Autocatalytic Sets: How Bit Strings and Reactions Shape Molecular Evolution

Authors: (1) Jonathan H. Rystrøm. Table of Links Abstract and Introduction Previous Literature Methods and Data Results Discussions Conclusions and References A. Validation of Assumptions B. Other Models C. Pre-processing steps 6 Conclusion Understanding how recommender systems shape our behaviour is essential to avoid manipulation. In this paper, we investigated the Amazon recommender system concerning whether it has made it harder to change preferences. By analysing the Barrier-to-Exit (Rakova & Chowdhury, 2019) of more than 50,000 users, we found a highly significant growth in Barrier-to-Exit over time, which indicates that it has indeed become harder to change preferences for the analysed users. However, sampling bias induced by the calculation of Barrier-to-Exit makes it difficult to draw conclusions about the general population of Amazon customers. This highlights the dilemma of portability in measuring socio-technical systems (Selbst et al., 2019): accurately evaluating a concept like ”changing preferences” requires adapting to the context of the system, which makes it more difficult to generalise (and compare) to other systems. Comparing recommender systems is necessary for ensuring that these respect human autonomy (Varshney, 2020) and live up to new regulations such as the EU AI Act (Kop, 2021). Further work, should aim to create auditing procedures and metrics that allow third parties to measure potential preference manipulation in a way that fits within the context of the industry and allows for comparisons between different systems. This will help assess the pressures of Surveillance Capitalism (Zuboff, 2019) on human autonomy. References Baayen, R. H., Davidson, D. J., & Bates, D. M. (2008). Mixed-effects modeling with crossed random effects for subjects and items. Journal of memory and language, 59 (4), 390–412. (Publisher: Elsevier) Barto´n, K. (2022, September). MuMIn: Multi-Model Inference. Retrieved 2023-01-08, from https://CRAN.R-project .org/package=MuMIn Bates, D., M¨achler, M., Bolker, B., & Walker, S. (2014, June). Fitting Linear Mixed-Effects Models using lme4. arXiv. Retrieved 2023-01-12, from http://arxiv.org/abs/1406.5823 (arXiv:1406.5823 [stat]) Bennett, J., & Lanning, S. (2007). The netflix prize. In Proceedings of KDD cup and workshop (Vol. 2007, p. 35). New York. urrell, J. (2016, June). How the machine ‘thinks’: Understanding opacity in machine learning algorithms. Big Data & Society, 3 (1), 2053951715622512. Retrieved 2022-10-11, from https://ezproxy-prd.bodleian.ox.ac.uk:2246/doi/full/10.1177/2053951715622512 (Publisher: SAGE Publications Ltd) doi: 10.1177/ 2053951715622512 Calvo, R. A., Peters, D., Vold, K., & Ryan, R. M. (2020). Supporting Human Autonomy in AI Systems: A Framework for Ethical Enquiry. In C. Burr & L. Floridi (Eds.), Ethics of Digital Well-Being: A Multidisciplinary Approach (pp. 31–54). Cham: Springer International Publishing. Retrieved 2022-08-16, from https://doi.org/10.1007/ 978-3-030-50585-1 2 doi: 10.1007/978-3-030-50585-1 2 Carroll, M. D., Dragan, A., Russell, S., & Hadfield-Menell, D. (2022). Estimating and penalizing induced preference shifts in recommender systems. In International Conference on Machine Learning (pp. 2686–2708). PMLR. Feng, C., Wang, H., Lu, N., Chen, T., He, H., Lu, Y., & Tu, X. M. (2014, April). Log-transformation and its implications for data analysis. Shanghai Archives of Psychiatry, 26 (2), 105–109. Retrieved 2023-01-10, from https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4120293/ doi: 10.3969/j.issn.1002-0829.2014.02.009 Floridi, L., Holweg, M., Taddeo, M., Amaya Silva, J., M¨okander, J., & Wen, Y. (2022, March). capAI - A Procedure for Conducting Conformity Assessment of AI Systems in Line with the EU Artificial Intelligence Act (SSRN Scholarly Paper No. ID 4064091). Rochester, NY: Social Science Research Network. Retrieved 2022-04-01, from https://papers.ssrn.com/abstract=4064091 doi: 10.2139/ssrn.4064091 Fox, J. (2003). Effect Displays in R for Generalised Linear Models. Journal of Statistical Software, 8 (15). Retrieved 2023-01-10, from http://www.jstatsoft.org/v08/i15/ doi: 10.18637/jss.v008.i15 Fox, J. (2015). Applied regression analysis and generalized linear models. Sage Publications. Franklin, M., Ashton, H., Gorman, R., & Armstrong, S. (2022, May). Missing Mechanisms of Manipulation in the EU AI Act. The International FLAIRS Conference Proceedings, 35 . Retrieved 2022-12-31, from https:// journals.flvc.org/FLAIRS/article/view/130723 doi: 10.32473/flairs.v35i.130723 Gebru, T., Morgenstern, J., Vecchione, B., Vaughan, J. W., Wallach, H., Daum´e III, H., & Crawford, K. (2021, December). Datasheets for Datasets. arXiv. Retrieved 2022-10-20, from http://arxiv.org/abs/1803.09010 (arXiv:1803.09010 [cs]) Ghasemi, A., & Zahediasl, S. (2012, December). Normality Tests for Statistical Analysis: A Guide for NonStatisticians. International Journal of Endocrinology and Metabolism, 10 (2), 486–489. Retrieved 2023-01-11, from https://brief.land/ijem/articles/71904.html doi: 10.5812/ijem.3505 Gorelick, M., & Ozsvald, I. (2020). High performance Python: practical performant programming for humans (Second edition ed.). Beijing [China] ; Boston [MA]: O’Reilly. Harper, F. M., & Konstan, J. A. (2016, January). The MovieLens Datasets: History and Context. ACM Transactions on Interactive Intelligent Systems, 5 (4), 1–19. Retrieved 2022-12-29, from https://dl.acm.org/doi/10.1145/ 2827872 doi: 10.1145/2827872 Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., . . . Oliphant, T. E. (2020, September). Array programming with NumPy. Nature, 585 (7825), 357–362. Retrieved 2021-12-27, from https://www.nature.com/articles/s41586-020-2649-2 doi: 10.1038/s41586-020-2649-2 Jannach, D., & Adomavicius, G. (2016, September). Recommendations with a Purpose. In Proceedings of the 10th ACM Conference on Recommender Systems (pp. 7–10). Boston Massachusetts USA: ACM. Retrieved 2022-09-01, from https://dl.acm.org/doi/10.1145/2959100.2959186 doi: 10.1145/2959100.2959186 Jiang, R., Chiappa, S., Lattimore, T., Gy¨orgy, A., & Kohli, P. (2019, January). Degenerate Feedback Loops in Recommender Systems. In Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society (pp. 383–390). Honolulu HI USA: ACM. Retrieved 2022-09-07, from https://dl.acm.org/doi/10.1145/3306618 .3314288 doi: 10.1145/3306618.3314288 Kipf, T. N., & Welling, M. (2017, February). Semi-Supervised Classification with Graph Convolutional Networks. arXiv. Retrieved 2022-12-14, from http://arxiv.org/abs/1609.02907 (arXiv:1609.02907 [cs, stat]) Knijnenburg, B. P., Reijmer, N. J., & Willemsen, M. C. (2011, October). Each to his own: how different users call for different interaction methods in recommender systems. In Proceedings of the fifth ACM conference on Recommender systems (pp. 141–148). New York, NY, USA: Association for Computing Machinery. Retrieved 2023-01-11, from https://doi.org/10.1145/2043932.2043960 doi: 10.1145/2043932.2043960 Kop, M. (2021, November). EU Artificial Intelligence Act: The European Approach to AI. , 11. Kuznetsova, A., Brockhoff, P. B., & Christensen, R. H. B. (2017). lmerTest package: tests in linear mixed effects models. Journal of statistical software, 82 (13). (Publisher: The Foundation for Open Access Statistics) Lam, S. K., Pitrou, A., & Seibert, S. (2015). Numba: A llvm-based python jit compiler. In Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC (pp. 1–6). Ledwich, M., & Zaitsev, A. (2019). Algorithmic extremism: Examining YouTube’s rabbit hole of radicalization. arXiv preprint arXiv:1912.11211 . Leino, J., & R¨aih¨a, K.-J. (2007, October). Case amazon: ratings and reviews as part of recommendations. In Proceedings of the 2007 ACM conference on Recommender systems (pp. 137–140). New York, NY, USA: Association for Computing Machinery. Retrieved 2023-01-08, from https://doi.org/10.1145/1297231.1297255 doi: 10.1145/1297231.1297255 Linden, G., Smith, B., & York, J. (2003). Amazon. com recommendations: Item-to-item collaborative filtering. IEEE Internet computing, 7 (1), 76–80. (Publisher: Ieee) Maddala, G. S. (1971, March). The Use of Variance Components Models in Pooling Cross Section and Time Series Data. Econometrica, 39 (2), 341. Retrieved 2023-01-11, from https://www.jstor.org/stable/1913349 ?origin=crossref doi: 10.2307/1913349 McAuley, J., Targett, C., Shi, Q., & Hengel, A. v. d. (2015, June). Image-based Recommendations on Styles and Substitutes. arXiv. Retrieved 2022-12-29, from http://arxiv.org/abs/1506.04757 (arXiv:1506.04757 [cs]) McKinney, W. (2011). pandas: a foundational Python library for data analysis and statistics. Python for high performance and scientific computing, 14 (9), 1–9. (Publisher: Seattle) Millecamp, M., Htun, N. N., Jin, Y., & Verbert, K. (2018). Controlling spotify recommendations: effects of personal characteristics on music recommender user interfaces. In Proceedings of the 26th Conference on user modeling, adaptation and personalization (pp. 101–109). Nakagawa, S., Johnson, P. C., & Schielzeth, H. (2017). The coefficient of determination R 2 and intra-class correlation coefficient from generalized linear mixed-effects models revisited and expanded. Journal of the Royal Society Interface, 14 (134), 20170213. (Publisher: The Royal Society) Nguyen, T. T., Hui, P.-M., Harper, F. M., Terveen, L., & Konstan, J. A. (2014). Exploring the filter bubble: the effect of using recommender systems on content diversity. In Proceedings of the 23rd international conference on World wide web - WWW ’14 (pp. 677–686). Seoul, Korea: ACM Press. Retrieved 2022-12-31, from http:// dl.acm.org/citation.cfm?doid=2566486.2568012 doi: 10.1145/2566486.2568012 Ni, J., Li, J., & McAuley, J. (2019). Justifying recommendations using distantly-labeled reviews and fine-grained aspects. In Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP) (pp. 188–197). Nonnecke, B., & Preece, J. (2000). Lurker demographics: Counting the silent. In Proceedings of the SIGCHI conference on Human factors in computing systems (pp. 73–80). O’Hara, R., & Kotze, J. (2010, January). Do not log-transform count data. Nature Precedings. Retrieved 2023-01-11, from https://www.nature.com/articles/npre.2010.4136.1 doi: 10.1038/npre.2010.4136.1 Pandita, R. (2017). Internet: A change agent an overview of internet penetration & growth across the world. International Journal of Information Dissemination and Technology, 7 (2), 83–91. Retrieved 2023-01-11, from https://www.proquest.com/docview/1920419032/abstract/14B253C0DD6A4277PQ/1 (Num Pages: 83-91 Place: Ambala, India Publisher: Maharishi Markandehwar University) Papakyriakopoulos, O., Serrano, J. C. M., & Hegelich, S. (2020). Political communication on social media: A tale of hyperactive users and bias in recommender systems. Online Social Networks and Media, 15 , 100058. (Publisher: Elsevier) Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., . . . Dubourg, V. (2011). Scikit-learn: Machine learning in Python. the Journal of machine Learning research, 12 , 2825–2830. (Publisher: JMLR. org) Poole, M. A., & O’Farrell, P. N. (1971). The assumptions of the linear regression model. Transactions of the Institute of British Geographers, 145–158. (Publisher: JSTOR) Popper, K. R. (1970). Normal science and its dangers. Cambridge University Press Cambridge. Rakova, B., & Chowdhury, R. (2019, September). Human self-determination within algorithmic sociotechnical systems. arXiv. Retrieved 2022-09-07, from http://arxiv.org/abs/1909.06713 (arXiv:1909.06713 [cs]) Raschka, S., Patterson, J., & Nolet, C. (2020). Machine learning in python: Main developments and technology trends in data science, machine learning, and artificial intelligence. Information, 11 (4), 193. (Publisher: Multidisciplinary Digital Publishing Institute) Roski, J., Maier, E. J., Vigilante, K., Kane, E. A., & Matheny, M. E. (2021). Enhancing trust in AI through industry self-governance. Journal of the American Medical Informatics Association, 28 (7), 1582–1590. (Publisher: Oxford University Press) Sandvig, C., Hamilton, K., Karahalios, K., & Langbort, C. (2014). Auditing algorithms: Research methods for detecting discrimination on internet platforms. Data and discrimination: converting critical concerns into productive inquiry, 22 , 4349–4357. Satterthwaite, F. E. (1946, December). An Approximate Distribution of Estimates of Variance Components. Biometrics Bulletin, 2 (6), 110. Retrieved 2023-01-11, from https://www.jstor.org/stable/10.2307/3002019 ?origin=crossref doi: 10.2307/3002019 Schielzeth, H., Dingemanse, N. J., Nakagawa, S., Westneat, D. F., Allegue, H., Teplitsky, C., . . . Araya-Ajoy, Y. G. (2020, September). Robustness of linear mixed-effects models to violations of distributional assumptions. Methods in Ecology and Evolution, 11 (9), 1141–1152. Retrieved 2022-12-27, from https://onlinelibrary.wiley.com/ doi/10.1111/2041-210X.13434 doi: 10.1111/2041-210X.13434 Selbst, A. D., Boyd, D., Friedler, S. A., Venkatasubramanian, S., & Vertesi, J. (2019, January). Fairness and Abstraction in Sociotechnical Systems. In Proceedings of the Conference on Fairness, Accountability, and Transparency (pp. 59–68). Atlanta GA USA: ACM. Retrieved 2022-09-07, from https://dl.acm.org/doi/10.1145/3287560.3287598 doi: 10.1145/3287560.3287598 Smith, B., & Linden, G. (2017, May). Two Decades of Recommender Systems at Amazon.com. IEEE Internet Computing, 21 (3), 12–18. Retrieved 2022-12-20, from http://ieeexplore.ieee.org/document/7927889/ doi: 10.1109/MIC.2017.72 Timmers, H., & Wagenaar, W. A. (1977, November). Inverse statistics and misperception of exponential growth. Perception & Psychophysics, 21 (6), 558–562. Retrieved 2023-01-10, from https://doi.org/10.3758/BF03198737 doi: 10.3758/BF03198737 Van Rossum, G. (2007). Python Programming language. In USENIX annual technical conference (Vol. 41, pp. 1–36). (Issue: 1) Villadsen, A. R., & Wulff, J. N. (2021, July). Statistical Myths About Log-Transformed Dependent Variables and How to Better Estimate Exponential Models. British Journal of Management, 32 (3), 779–796. Retrieved 2023-01-12, from https://onlinelibrary.wiley.com/doi/10.1111/1467-8551.12431 doi: 10.1111/1467-8551.12431 Wells, J. R., Danskin, G., & Ellsworth, G. (2018). Amazon. com, 2018. Harvard Business School Case Study(716-402). Wood, S. N., Pya, N., & S¨afken, B. (2016, October). Smoothing Parameter and Model Selection for General Smooth Models. Journal of the American Statistical Association, 111 (516), 1548–1563. Retrieved 2023- 01-12, from https://doi.org/10.1080/01621459.2016.1180986 (Publisher: Taylor & Francis eprint: https://doi.org/10.1080/01621459.2016.1180986) doi: 10.1080/01621459.2016.1180986 Zhu, F., & Liu, Q. (2018). Competing with complementors: An empirical look at Amazon.com. Strategic Management Journal, 39 (10), 2618–2642. Retrieved 2023-01-11, from https://onlinelibrary.wiley.com/doi/ abs/10.1002/smj.2932 ( eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/smj.2932) doi: 10.1002/ smj.2932 Zuboff, S. (2019). The Age of Surveillance Capitalism: The Fight for a Human Future at the New Frontier of Power: Barack Obama’s Books of 2019. Profile Books. This paper is under CC 4.0 license. available on arxiv

Ensuring Ethical AI: Lessons from Amazon's Barrier-to-Exit Analysis

Authors:
(1) Renan F. F. da Silva, Institute of Computing, University of Campinas;
(2) Yulle G. F. Borges, Institute of Computing, University of Campinas;
(3) Rafael C. S. Schouery, Institute of Computing, University of Campinas. 9 Conclusion Our approaches were quite effective, enabling us to find solutions very close to the optimal solution, even in instances with many items. These results are partly due to the excellent quality of the solutions given by Two-by-Two, which efficiently handles color constraints. Another positive factors are our neighborhoods, which are efficient in quality and time complexity. Lastly, Gilmore and Gomory Formulation has a strong relaxation for the BPP, and this property may extend to CBPP. For a strong relaxation, the values for the optimal fractional and integer solutions are very close, so the patterns used by relaxation probably belong to integer solutions of high quality. Therefore, this is an excellent method to find a good set of patterns for the initial build of GRASP. Acknowledgements This project was supported by the S˜ao Paulo Research Foundation (FAPESP) grants #2015/11937-9 and #2020/06511-0; and the Brazilian National Council For Scientific and Technological Development (CNPq) grants #144257/2019-0, #311039/2020-0 and #425340/2016 3. Declarations Conflict of interest All authors declare that they have no conflicts of interest. References [1] Alsarhan H, Chia D, Christman A, et al (2016) A two-pass algorithm for unordered colored bin packing. Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School pp 1–10 [2] Balogh J, B´ek´esi J, Dosa G, et al (2013) Black and white bin packing. In: Erlebach T, Persiano G (eds) Approximation and Online Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 131–144, https://doi.org/10.1007/978-3-642-38016-7_12 [3] Balogh J, B´ek´esi J, D´osa G, et al (2015) Offline black and white bin packing. Theoretical Computer Science 596:92–101. https://doi.org/10.1016/j.tcs.2015.06.045 [4] Belov G, Scheithauer G (2006) A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research 171(1):85–106. https://doi.org/10.1016/j.ejor.2004.08.036 [5] B¨ohm M, Sgall J, Vesel´y P (2015) Online colored bin packing. In: Bampis E, Svensson O (eds) Approximation and Online Algorithms. Springer International Publishing, Cham, pp 35–46, https://doi.org/10.1007/978-3-319-18263-6_4 [6] B¨ohm M, D´osa G, Epstein L, et al (2018) Colored bin packing: Online algorithms and lower bounds. Algorithmica 80(1):155–184. https://doi.org/10.1007/s00453-016-0248-2 [7] Borges Y, Schouery R (2020) Modelos pseudo polinomiais para o problema do empacotamento colorido. In: Anais do V Encontro de Teoria da Computa¸c˜ao, pp 37–40, https://doi.org/ 10.5753/etc.2020.11084, (In Portuguese) [8] Borges YGF, Schouery RCS, Miyazawa FK (2023) Mathematical models and exact algorithms for the colored bin packing problem. 2305.15291 [9] Brand˜ao F, Pedroso JP (2016) Bin packing and related problems: General arc-flow formulation with graph compression. Computers & Operations Research 69:56–67. https://doi.org/10. 1016/j.cor.2015.11.009 [10] Buljubaˇsi´c M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers & Operations Research 76:12–21. https://doi.org/10.1016/j.cor.2016.06.009 [11] Carvalho JMVd (1999) Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86(0):629–659. https://doi.org/10. 1023/A:1018952112615 [12] Castelli M, Vanneschi L (2014) A hybrid harmony search algorithm with variable neighbourhood search for the bin-packing problem. 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014) pp 1–6. https://doi.org/10.1109/NaBIC.2014. 6921849 [13] Chen J, Han X, Bein W, et al (2015) Black and white bin packing revisited. In: Lu Z, Kim D, Wu W, et al (eds) Combinatorial Optimization and Applications. Springer International Publishing, Cham, pp 45–59, https://doi.org/10.1007/978-3-319-26626-8_4 [14] Delorme M, Iori M (2020) Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS Journal on Computing 32(1):101–119. https://doi.org/ 10.1287/ijoc.2018.0880 [15] Delorme M, Iori M, Martello S (2018) Bpplib: a library for bin packing and cutting stock problems. Optimization Letters 12(2):235–250. https://doi.org/10.1007/s11590-017-1192-z [16] Demˇsar J (2006) Statistical comparisons of classifiers over multiple data sets. The Journal of Machine learning research 7:1–30 [17] D´osa G, Epstein L (2014) Colorful bin packing. In: Ravi R, Gørtz IL (eds) Algorithm Theory – SWAT 2014. Springer International Publishing, Cham, pp 170–181, https://doi.org/10. 1007/978-3-319-08404-6_15 [18] Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8(2):67–71. https://doi.org/https://doi.org/ 10.1016/0167-6377(89)90002-3 [19] Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Computers & Operations Research 29(7):821–839. https://doi.org/10.1016/S0305-0548(00)00082-4 [20] Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32(200):675–701. https: //doi.org/10.1080/01621459.1937.10503522 [21] Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Operations Research 9(6):849–859. https://doi.org/10.1287/opre.29.6.1092 [22] Gonz´alez-San-Mart´ın J, Cruz-Reyes L, G´omez-Santill´an C, et al (2023) Comparative Study of Heuristics for the One-Dimensional Bin Packing Problem, Springer Nature Switzerland, Cham, pp 293–305. https://doi.org/10.1007/978-3-031-28999-6_19 [23] Gupta JND, Ho JC (1999) A new heuristic algorithm for the one-dimensional binpacking problem. Production Planning & Control 10(6):598–603. https://doi.org/10.1080/ 095372899232894 [24] Iman RL, Davenport JM (1980) Approximations of the critical region of the fbietkan statistic. Communications in Statistics - Theory and Methods 9(6):571–595. https://doi.org/10. 1080/03610928008827904 [25] Karp RM (1972) Reducibility among Combinatorial Problems, Springer US, Boston, MA, pp 85–103. https://doi.org/10.1007/978-1-4684-2001-2_9 [26] de Lima VL, Iori M, Miyazawa FK (2022) Exact solution of network flow models with strong relaxations. Mathematical Programming pp 1–34. https://doi.org/10.1007/ s10107-022-01785-9 [27] Loh KH, Golden B, Wasil E (2008) Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research 35(7):2283–2291. https:// doi.org/10.1016/j.cor.2006.10.021 [28] Mladenovi´c N, Hansen P (1997) Variable neighborhood search. Computers & Operations Research 24(11):1097–1100. https://doi.org/10.1016/S0305-0548(97)00031-2 [29] Nemenyi PB (1963) Distribution-free multiple comparisons. PhD thesis, Princeton University [30] Pessoa A, Sadykov R, Uchoa E, et al (2020) A generic exact solver for vehicle routing and related problems. Mathematical Programming 183(1):483–523. https://doi.org/10.1007/ s10107-020-01523-z [31] Vance PH (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications 9(3):211–228. https://doi.org/10.1023/A: 1018346107246 [32] Wei L, Luo Z, Baldacci R, et al (2020) A new branch-and-price-and-cut algorithm for onedimensional bin-packing problems. INFORMS Journal on Computing 32(2):428–443. https://doi.org/10.1287/ijoc.2018.0867 This paper is available on arxiv under CC 4.0 license. Authors: (1) Renan F. F. da Silva, Institute of Computing, University of Campinas; (2) Yulle G. F. Borges, Institute of Computing, University of Campinas; (3) Rafael C. S. Schouery, Institute of Computing, University of Campinas. Authors: (1) Renan F. F. da Silva, Institute of Computing, University of Campinas; (2) Yulle G. F. Borges, Institute of Computing, University of Campinas; (3) Rafael C. S. Schouery, Institute of Computing, University of Campinas. 9 Conclusion Our approaches were quite effective, enabling us to find solutions very close to the optimal solution, even in instances with many items. These results are partly due to the excellent quality of the solutions given by Two-by-Two, which efficiently handles color constraints. Another positive factors are our neighborhoods, which are efficient in quality and time complexity. Lastly, Gilmore and Gomory Formulation has a strong relaxation for the BPP, and this property may extend to CBPP. For a strong relaxation, the values for the optimal fractional and integer solutions are very close, so the patterns used by relaxation probably belong to integer solutions of high quality. Therefore, this is an excellent method to find a good set of patterns for the initial build of GRASP. Acknowledgements This project was supported by the S˜ao Paulo Research Foundation (FAPESP) grants #2015/11937-9 and #2020/06511-0; and the Brazilian National Council For Scientific and Technological Development (CNPq) grants #144257/2019-0, #311039/2020-0 and #425340/2016 3. Acknowledgements Declarations Conflict of interest All authors declare that they have no conflicts of interest. Conflict of interest References [1] Alsarhan H, Chia D, Christman A, et al (2016) A two-pass algorithm for unordered colored bin packing. Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School pp 1–10 [2] Balogh J, B´ek´esi J, Dosa G, et al (2013) Black and white bin packing. In: Erlebach T, Persiano G (eds) Approximation and Online Algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 131–144, https://doi.org/10.1007/978-3-642-38016-7_12 [3] Balogh J, B´ek´esi J, D´osa G, et al (2015) Offline black and white bin packing. Theoretical Computer Science 596:92–101. https://doi.org/10.1016/j.tcs.2015.06.045 [4] Belov G, Scheithauer G (2006) A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research 171(1):85–106. https://doi.org/10.1016/j.ejor.2004.08.036 [5] B¨ohm M, Sgall J, Vesel´y P (2015) Online colored bin packing. In: Bampis E, Svensson O (eds) Approximation and Online Algorithms. Springer International Publishing, Cham, pp 35–46, https://doi.org/10.1007/978-3-319-18263-6_4 [6] B¨ohm M, D´osa G, Epstein L, et al (2018) Colored bin packing: Online algorithms and lower bounds. Algorithmica 80(1):155–184. https://doi.org/10.1007/s00453-016-0248-2 [7] Borges Y, Schouery R (2020) Modelos pseudo polinomiais para o problema do empacotamento colorido. In: Anais do V Encontro de Teoria da Computa¸c˜ao, pp 37–40, https://doi.org/ 10.5753/etc.2020.11084, (In Portuguese) [8] Borges YGF, Schouery RCS, Miyazawa FK (2023) Mathematical models and exact algorithms for the colored bin packing problem. 2305.15291 [9] Brand˜ao F, Pedroso JP (2016) Bin packing and related problems: General arc-flow formulation with graph compression. Computers & Operations Research 69:56–67. https://doi.org/10. 1016/j.cor.2015.11.009 [10] Buljubaˇsi´c M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Computers & Operations Research 76:12–21. https://doi.org/10.1016/j.cor.2016.06.009 [11] Carvalho JMVd (1999) Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86(0):629–659. https://doi.org/10. 1023/A:1018952112615 [12] Castelli M, Vanneschi L (2014) A hybrid harmony search algorithm with variable neighbourhood search for the bin-packing problem. 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014) pp 1–6. https://doi.org/10.1109/NaBIC.2014. 6921849 [13] Chen J, Han X, Bein W, et al (2015) Black and white bin packing revisited. In: Lu Z, Kim D, Wu W, et al (eds) Combinatorial Optimization and Applications. Springer International Publishing, Cham, pp 45–59, https://doi.org/10.1007/978-3-319-26626-8_4 [14] Delorme M, Iori M (2020) Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS Journal on Computing 32(1):101–119. https://doi.org/ 10.1287/ijoc.2018.0880 [15] Delorme M, Iori M, Martello S (2018) Bpplib: a library for bin packing and cutting stock problems. Optimization Letters 12(2):235–250. https://doi.org/10.1007/s11590-017-1192-z [16] Demˇsar J (2006) Statistical comparisons of classifiers over multiple data sets. The Journal of Machine learning research 7:1–30 [17] D´osa G, Epstein L (2014) Colorful bin packing. In: Ravi R, Gørtz IL (eds) Algorithm Theory – SWAT 2014. Springer International Publishing, Cham, pp 170–181, https://doi.org/10. 1007/978-3-319-08404-6_15 [18] Feo TA, Resende MG (1989) A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8(2):67–71. https://doi.org/https://doi.org/ 10.1016/0167-6377(89)90002-3 [19] Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Computers & Operations Research 29(7):821–839. https://doi.org/10.1016/S0305-0548(00)00082-4 [20] Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association 32(200):675–701. https: //doi.org/10.1080/01621459.1937.10503522 [21] Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Operations Research 9(6):849–859. https://doi.org/10.1287/opre.29.6.1092 [22] Gonz´alez-San-Mart´ın J, Cruz-Reyes L, G´omez-Santill´an C, et al (2023) Comparative Study of Heuristics for the One-Dimensional Bin Packing Problem, Springer Nature Switzerland, Cham, pp 293–305. https://doi.org/10.1007/978-3-031-28999-6_19 [23] Gupta JND, Ho JC (1999) A new heuristic algorithm for the one-dimensional binpacking problem. Production Planning & Control 10(6):598–603. https://doi.org/10.1080/ 095372899232894 [24] Iman RL, Davenport JM (1980) Approximations of the critical region of the fbietkan statistic. Communications in Statistics - Theory and Methods 9(6):571–595. https://doi.org/10. 1080/03610928008827904 [25] Karp RM (1972) Reducibility among Combinatorial Problems, Springer US, Boston, MA, pp 85–103. https://doi.org/10.1007/978-1-4684-2001-2_9 [26] de Lima VL, Iori M, Miyazawa FK (2022) Exact solution of network flow models with strong relaxations. Mathematical Programming pp 1–34. https://doi.org/10.1007/ s10107-022-01785-9 [27] Loh KH, Golden B, Wasil E (2008) Solving the one-dimensional bin packing problem with a weight annealing heuristic. Computers & Operations Research 35(7):2283–2291. https:// doi.org/10.1016/j.cor.2006.10.021 [28] Mladenovi´c N, Hansen P (1997) Variable neighborhood search. Computers & Operations Research 24(11):1097–1100. https://doi.org/10.1016/S0305-0548(97)00031-2 [29] Nemenyi PB (1963) Distribution-free multiple comparisons. PhD thesis, Princeton University [30] Pessoa A, Sadykov R, Uchoa E, et al (2020) A generic exact solver for vehicle routing and related problems. Mathematical Programming 183(1):483–523. https://doi.org/10.1007/ s10107-020-01523-z [31] Vance PH (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications 9(3):211–228. https://doi.org/10.1023/A: 1018346107246 [32] Wei L, Luo Z, Baldacci R, et al (2020) A new branch-and-price-and-cut algorithm for onedimensional bin-packing problems. INFORMS Journal on Computing 32(2):428–443. https://doi.org/10.1287/ijoc.2018.0867 This paper is available on arxiv under CC 4.0 license. This paper is available on arxiv under CC 4.0 license. available on arxiv

BOSTON SCIENTIFIC

bostonscientific.com

10K+ employees

Since 1972

COMPANY RANKING

BOSTON SCIENTIFIC

EVERGREEN INDEX #3613

Representing this company? Click here to claim and customize this page!

Boston Scientific WIKI

Apply to get your Tech Company News Page live on HackerNoon.com today!

BOSTON SCIENTIFIC

bostonscientific.com

10K+ employees

Since 1972

COMPANY RANKING

BOSTON SCIENTIFIC

EVERGREEN INDEX #3613

RELATED COMPANIESRANK

STORIES ABOUT BOSTON SCIENTIFIC

Representing this company? Click here to claim and customize this page!

Boston Scientific WIKI

Apply to get your Tech Company News Page live on HackerNoon.com today!